/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:59:22,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:59:22,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:59:22,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:59:22,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:59:22,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:59:22,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:59:22,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:59:22,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:59:22,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:59:22,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:59:22,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:59:22,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:59:22,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:59:22,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:59:22,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:59:22,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:59:22,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:59:22,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:59:22,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:59:22,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:59:22,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:59:22,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:59:22,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:59:22,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:59:22,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:59:22,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:59:22,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:59:22,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:59:22,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:59:22,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:59:22,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:59:22,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:59:22,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:59:22,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:59:22,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:59:22,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:59:22,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:59:22,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:59:22,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:59:22,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:59:22,063 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:59:22,078 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:59:22,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:59:22,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:59:22,079 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:59:22,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:59:22,079 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:59:22,080 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:59:22,080 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:59:22,080 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:59:22,080 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:59:22,080 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:59:22,080 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:59:22,081 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:59:22,081 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:59:22,081 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:59:22,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:59:22,081 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:59:22,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:59:22,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:59:22,082 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:59:22,082 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:59:22,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:59:22,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:59:22,083 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:59:22,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:59:22,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:59:22,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:59:22,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:59:22,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:59:22,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:59:22,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:59:22,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:59:22,268 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:59:22,268 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:59:22,269 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:59:22,341 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_zzHW0k/tmp/a27efe665f0648a39525ae41159a8ed1/FLAG4dd92a7a8 [2020-07-01 12:59:22,671 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:59:22,672 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:59:22,672 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:59:22,678 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_zzHW0k/tmp/a27efe665f0648a39525ae41159a8ed1/FLAG4dd92a7a8 [2020-07-01 12:59:23,078 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_zzHW0k/tmp/a27efe665f0648a39525ae41159a8ed1 [2020-07-01 12:59:23,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:59:23,091 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:59:23,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:59:23,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:59:23,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:59:23,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b9a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23, skipping insertion in model container [2020-07-01 12:59:23,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:59:23,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:59:23,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:59:23,381 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:59:23,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:59:23,416 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:59:23,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23 WrapperNode [2020-07-01 12:59:23,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:59:23,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:59:23,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:59:23,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:59:23,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:59:23,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:59:23,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:59:23,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:59:23,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:59:23,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:59:23,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:59:23,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:59:23,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:59:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:59:23,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:59:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:59:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:59:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:59:23,774 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:59:23,775 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:59:23,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:59:23 BoogieIcfgContainer [2020-07-01 12:59:23,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:59:23,779 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:59:23,779 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:59:23,781 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:59:23,782 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:59:23" (1/1) ... [2020-07-01 12:59:23,795 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 23 edges [2020-07-01 12:59:23,796 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:59:23,797 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:59:23,797 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:59:23,798 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:59:23,800 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:59:23,801 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:59:23,801 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:59:23,820 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:59:23,841 INFO L200 BlockEncoder]: SBE split 6 edges [2020-07-01 12:59:23,846 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:59:23,848 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:59:23,861 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 12:59:23,864 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 12:59:23,865 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:59:23,866 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:59:23,866 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:59:23,868 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:59:23,869 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 20 edges [2020-07-01 12:59:23,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:59:23 BasicIcfg [2020-07-01 12:59:23,870 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:59:23,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:59:23,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:59:23,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:59:23,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:59:23" (1/4) ... [2020-07-01 12:59:23,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:59:23, skipping insertion in model container [2020-07-01 12:59:23,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (2/4) ... [2020-07-01 12:59:23,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:59:23, skipping insertion in model container [2020-07-01 12:59:23,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:59:23" (3/4) ... [2020-07-01 12:59:23,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:59:23, skipping insertion in model container [2020-07-01 12:59:23,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:59:23" (4/4) ... [2020-07-01 12:59:23,879 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:59:23,889 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:59:23,896 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-01 12:59:23,909 INFO L251 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-07-01 12:59:23,933 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:59:23,933 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:59:23,933 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:59:23,933 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:59:23,933 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:59:23,933 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:59:23,934 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:59:23,934 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:59:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-01 12:59:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:59:23,954 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:23,955 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:23,955 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:59:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:23,961 INFO L82 PathProgramCache]: Analyzing trace with hash 427553221, now seen corresponding path program 1 times [2020-07-01 12:59:23,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:23,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321217553] [2020-07-01 12:59:23,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:24,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321217553] [2020-07-01 12:59:24,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:24,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:59:24,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699659304] [2020-07-01 12:59:24,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:59:24,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:24,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:59:24,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:59:24,176 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2020-07-01 12:59:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:24,279 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. [2020-07-01 12:59:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:59:24,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:59:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:24,293 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:59:24,293 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:59:24,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:59:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:59:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2020-07-01 12:59:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 12:59:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2020-07-01 12:59:24,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 7 [2020-07-01 12:59:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:24,335 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 19 transitions. [2020-07-01 12:59:24,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:59:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 19 transitions. [2020-07-01 12:59:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:59:24,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:24,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:24,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:59:24,337 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:59:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:24,338 INFO L82 PathProgramCache]: Analyzing trace with hash 427554182, now seen corresponding path program 1 times [2020-07-01 12:59:24,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:24,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808639762] [2020-07-01 12:59:24,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:24,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808639762] [2020-07-01 12:59:24,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:24,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:59:24,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12677360] [2020-07-01 12:59:24,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:59:24,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:24,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:59:24,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:59:24,405 INFO L87 Difference]: Start difference. First operand 12 states and 19 transitions. Second operand 5 states. [2020-07-01 12:59:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:24,487 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2020-07-01 12:59:24,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:59:24,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-01 12:59:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:24,509 INFO L225 Difference]: With dead ends: 12 [2020-07-01 12:59:24,509 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 12:59:24,510 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:59:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 12:59:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 12:59:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 12:59:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 12:59:24,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2020-07-01 12:59:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:24,513 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 12:59:24,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:59:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-01 12:59:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:59:24,514 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:24,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:24,515 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:59:24,515 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:59:24,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:24,515 INFO L82 PathProgramCache]: Analyzing trace with hash 427554184, now seen corresponding path program 1 times [2020-07-01 12:59:24,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:24,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603224304] [2020-07-01 12:59:24,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:24,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603224304] [2020-07-01 12:59:24,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:24,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:59:24,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40221223] [2020-07-01 12:59:24,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:59:24,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:24,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:59:24,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:59:24,593 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 6 states. [2020-07-01 12:59:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:24,700 INFO L93 Difference]: Finished difference Result 15 states and 23 transitions. [2020-07-01 12:59:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:59:24,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 12:59:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:24,703 INFO L225 Difference]: With dead ends: 15 [2020-07-01 12:59:24,703 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:59:24,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:59:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:59:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-01 12:59:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 12:59:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-07-01 12:59:24,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 7 [2020-07-01 12:59:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:24,709 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-01 12:59:24,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:59:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-01 12:59:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:59:24,710 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:24,710 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:24,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:59:24,711 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:59:24,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:24,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2012563625, now seen corresponding path program 1 times [2020-07-01 12:59:24,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:24,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780691254] [2020-07-01 12:59:24,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:24,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780691254] [2020-07-01 12:59:24,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:24,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:59:24,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520640301] [2020-07-01 12:59:24,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:59:24,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:59:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:59:24,761 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 4 states. [2020-07-01 12:59:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:24,800 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2020-07-01 12:59:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:59:24,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 12:59:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:24,802 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:59:24,802 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:59:24,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:59:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:59:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 12:59:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:59:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2020-07-01 12:59:24,806 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 12 [2020-07-01 12:59:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:24,807 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-01 12:59:24,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:59:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2020-07-01 12:59:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:59:24,807 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:24,807 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:24,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:59:24,808 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:59:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2012564586, now seen corresponding path program 1 times [2020-07-01 12:59:24,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:24,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584129788] [2020-07-01 12:59:24,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:24,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584129788] [2020-07-01 12:59:24,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732506942] [2020-07-01 12:59:24,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:59:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:24,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 12:59:24,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:59:25,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:59:25,052 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:59:25,061 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:59:25,062 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:59:25,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-01 12:59:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:25,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:59:25,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2020-07-01 12:59:25,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256780852] [2020-07-01 12:59:25,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:59:25,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:59:25,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:59:25,216 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 15 states. [2020-07-01 12:59:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:25,464 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-01 12:59:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:59:25,465 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-07-01 12:59:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:25,466 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:59:25,466 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:59:25,467 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2020-07-01 12:59:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:59:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-07-01 12:59:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:59:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-07-01 12:59:25,471 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 12 [2020-07-01 12:59:25,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:25,471 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-01 12:59:25,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:59:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-01 12:59:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:59:25,472 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:25,472 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:25,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:59:25,673 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:59:25,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2012564587, now seen corresponding path program 1 times [2020-07-01 12:59:25,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:25,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700646591] [2020-07-01 12:59:25,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:25,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700646591] [2020-07-01 12:59:25,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058669899] [2020-07-01 12:59:25,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:59:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:25,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:59:25,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:59:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:25,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:59:25,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:59:25,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497494245] [2020-07-01 12:59:25,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:59:25,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:59:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:59:25,788 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 8 states. [2020-07-01 12:59:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:25,894 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-01 12:59:25,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:59:25,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-01 12:59:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:25,896 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:59:25,896 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:59:25,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:59:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:59:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:59:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:59:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-07-01 12:59:25,900 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2020-07-01 12:59:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:25,900 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-01 12:59:25,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:59:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-07-01 12:59:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:59:25,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:25,901 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:26,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:59:26,102 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:59:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2139680519, now seen corresponding path program 1 times [2020-07-01 12:59:26,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:26,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932364296] [2020-07-01 12:59:26,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:26,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932364296] [2020-07-01 12:59:26,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244086166] [2020-07-01 12:59:26,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:59:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:26,219 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:59:26,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:59:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:26,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:59:26,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 12:59:26,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059256347] [2020-07-01 12:59:26,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:59:26,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:26,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:59:26,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:59:26,229 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 5 states. [2020-07-01 12:59:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:26,265 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-07-01 12:59:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:59:26,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-01 12:59:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:26,267 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:59:26,267 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:59:26,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:59:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:59:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:59:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:59:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-07-01 12:59:26,271 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2020-07-01 12:59:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:26,271 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-01 12:59:26,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:59:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2020-07-01 12:59:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:59:26,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:59:26,272 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:59:26,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:59:26,473 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-07-01 12:59:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2139681480, now seen corresponding path program 2 times [2020-07-01 12:59:26,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:26,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602359117] [2020-07-01 12:59:26,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:59:26,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602359117] [2020-07-01 12:59:26,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780476900] [2020-07-01 12:59:26,589 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:59:26,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:59:26,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:59:26,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 35 conjunts are in the unsatisfiable core [2020-07-01 12:59:26,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:59:26,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:59:26,642 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:59:26,649 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:59:26,649 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:59:26,650 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-01 12:59:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:26,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:59:26,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-07-01 12:59:26,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185848486] [2020-07-01 12:59:26,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 12:59:26,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:26,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 12:59:26,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:59:26,795 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 18 states. [2020-07-01 12:59:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:27,222 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-07-01 12:59:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-01 12:59:27,223 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2020-07-01 12:59:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:59:27,223 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:59:27,223 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:59:27,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2020-07-01 12:59:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:59:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:59:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:59:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:59:27,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-01 12:59:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:59:27,225 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:59:27,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 12:59:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:59:27,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:59:27,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:59:27,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:59:27,550 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:59:27,551 INFO L268 CegarLoopResult]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2020-07-01 12:59:27,551 INFO L268 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2020-07-01 12:59:27,551 INFO L268 CegarLoopResult]: For program point L23-2(lines 19 32) no Hoare annotation was computed. [2020-07-01 12:59:27,551 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:59:27,551 INFO L268 CegarLoopResult]: For program point L12-1(lines 12 13) no Hoare annotation was computed. [2020-07-01 12:59:27,551 INFO L268 CegarLoopResult]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2020-07-01 12:59:27,551 INFO L268 CegarLoopResult]: For program point L11-2(lines 11 14) no Hoare annotation was computed. [2020-07-01 12:59:27,551 INFO L268 CegarLoopResult]: For program point L8(lines 8 15) no Hoare annotation was computed. [2020-07-01 12:59:27,552 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:59:27,552 INFO L264 CegarLoopResult]: At program point L11-4(lines 11 14) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_cmemchr_~n (select |#length| ULTIMATE.start_cmemchr_~s.base))) (.cse1 (= 1 (select |#valid| ULTIMATE.start_cmemchr_~p~0.base))) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cmemchr_~s.base))) (.cse3 (<= 1 ULTIMATE.start_main_~n~0)) (.cse5 (<= 1 ULTIMATE.start_cmemchr_~n)) (.cse4 (select |#length| ULTIMATE.start_cmemchr_~p~0.base)) (.cse6 (= 0 ULTIMATE.start_cmemchr_~s.offset))) (or (and (= ULTIMATE.start_cmemchr_~p~0.offset 0) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_cmemchr_~n .cse4) .cse5 .cse6) (and .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_cmemchr_~p~0.offset) .cse3 .cse5 (<= (+ ULTIMATE.start_cmemchr_~p~0.offset ULTIMATE.start_cmemchr_~n) .cse4) .cse6))) [2020-07-01 12:59:27,552 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:59:27,554 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:59:27,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:59:27 BasicIcfg [2020-07-01 12:59:27,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:59:27,575 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:59:27,575 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:59:27,578 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:59:27,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:27,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:59:23" (1/5) ... [2020-07-01 12:59:27,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d028113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:59:27, skipping insertion in model container [2020-07-01 12:59:27,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:27,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:59:23" (2/5) ... [2020-07-01 12:59:27,580 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d028113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:59:27, skipping insertion in model container [2020-07-01 12:59:27,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:27,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:59:23" (3/5) ... [2020-07-01 12:59:27,580 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d028113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:59:27, skipping insertion in model container [2020-07-01 12:59:27,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:27,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:59:23" (4/5) ... [2020-07-01 12:59:27,581 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d028113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:59:27, skipping insertion in model container [2020-07-01 12:59:27,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:59:27,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:59:27" (5/5) ... [2020-07-01 12:59:27,583 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:59:27,602 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:59:27,603 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:59:27,603 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:59:27,603 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:59:27,603 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:59:27,603 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:59:27,603 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:59:27,603 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:59:27,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-01 12:59:27,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 12:59:27,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:59:27,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:59:27,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:59:27,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:59:27,616 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:59:27,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-01 12:59:27,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 12:59:27,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:59:27,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:59:27,617 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:59:27,617 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:59:27,622 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue [93] ULTIMATE.startENTRY-->L23: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_10| 0 0) |v_#valid_9|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length~0] 10#L23true [73] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 4#L23-2true [61] L23-2-->L26-1: Formula: (and (< v_ULTIMATE.start_main_~n~0_5 1) (= v_ULTIMATE.start_main_~n~0_4 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 13#L26-1true [82] L26-1-->L8: Formula: (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_cmemchr_~s.base_1 |v_ULTIMATE.start_cmemchr_#in~s.base_1|) (= |v_ULTIMATE.start_cmemchr_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemchr_~n_4 |v_ULTIMATE.start_cmemchr_#in~n_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= |v_ULTIMATE.start_cmemchr_#in~s.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~n~0_7)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= |v_ULTIMATE.start_cmemchr_#in~s.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= |v_ULTIMATE.start_cmemchr_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_cmemchr_~s.offset_1 |v_ULTIMATE.start_cmemchr_#in~s.offset_1|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= v_ULTIMATE.start_cmemchr_~c_1 |v_ULTIMATE.start_cmemchr_#in~c_1|)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_1, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_4, ULTIMATE.start_cmemchr_#in~s.offset=|v_ULTIMATE.start_cmemchr_#in~s.offset_1|, ULTIMATE.start_cmemchr_#res.base=|v_ULTIMATE.start_cmemchr_#res.base_3|, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, ULTIMATE.start_cmemchr_#in~n=|v_ULTIMATE.start_cmemchr_#in~n_1|, #length=|v_#length_1|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_1|, ULTIMATE.start_cmemchr_#res.offset=|v_ULTIMATE.start_cmemchr_#res.offset_3|, ULTIMATE.start_cmemchr_#in~c=|v_ULTIMATE.start_cmemchr_#in~c_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_cmemchr_#in~s.base=|v_ULTIMATE.start_cmemchr_#in~s.base_1|, ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_1|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_1|, ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_1, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~s.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemchr_#in~c, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_cmemchr_#in~s.base, ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_~n, ULTIMATE.start_cmemchr_#in~s.offset, ULTIMATE.start_cmemchr_#t~post1.base, ULTIMATE.start_cmemchr_~c, ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_#res.base, ULTIMATE.start_cmemchr_~s.offset, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_cmemchr_#in~n, #length, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#res.offset] 12#L8true [84] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_2 v_ULTIMATE.start_cmemchr_~s.base_3) (< 0 v_ULTIMATE.start_cmemchr_~n_6) (= v_ULTIMATE.start_cmemchr_~p~0.offset_2 v_ULTIMATE.start_cmemchr_~s.offset_3)) InVars {ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_2, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset] 11#L11-4true [2020-07-01 12:59:27,623 INFO L796 eck$LassoCheckResult]: Loop: 11#L11-4true [51] L11-4-->L12: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.offset_3 (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cmemchr_~p~0.base_3 |v_ULTIMATE.start_cmemchr_#t~post1.base_2|) (= |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| v_ULTIMATE.start_cmemchr_~p~0.offset_4) (= |v_ULTIMATE.start_cmemchr_#t~post1.base_2| v_ULTIMATE.start_cmemchr_~p~0.base_4)) InVars {ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_4, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_4} OutVars{ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_3, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_3, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_2|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~post1.base] 9#L12true [66] L12-->L12-1: Formula: (and (= 1 (select |v_#valid_7| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|)) (= (select (select |v_#memory_int_1| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) |v_ULTIMATE.start_cmemchr_#t~mem2_2|) (<= 0 |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_3| 1) (select |v_#length_3| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|))) InVars {#memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, #length=|v_#length_3|, #valid=|v_#valid_7|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_2|, #length=|v_#length_3|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~mem2] 7#L12-1true [89] L12-1-->L11-1: Formula: (> (mod |v_ULTIMATE.start_cmemchr_#t~mem2_6| 256) (mod v_ULTIMATE.start_cmemchr_~c_4 256)) InVars {ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_6|} OutVars{ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_6|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_5|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#t~post1.base] 3#L11-1true [60] L11-1-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemchr_~n_2 (- 1)))) (and (= v_ULTIMATE.start_cmemchr_~n_1 .cse0) (= |v_ULTIMATE.start_cmemchr_#t~pre0_1| .cse0))) InVars {ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_2} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_1|, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_1} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_cmemchr_~n] 14#L11-2true [91] L11-2-->L11-4: Formula: (> 0 |v_ULTIMATE.start_cmemchr_#t~pre0_5|) InVars {ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_5|} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_4|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0] 11#L11-4true [2020-07-01 12:59:27,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:27,624 INFO L82 PathProgramCache]: Analyzing trace with hash 116752594, now seen corresponding path program 1 times [2020-07-01 12:59:27,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:27,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817124240] [2020-07-01 12:59:27,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:59:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:59:27,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817124240] [2020-07-01 12:59:27,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:59:27,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:59:27,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649974611] [2020-07-01 12:59:27,642 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:59:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:59:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash 77782408, now seen corresponding path program 1 times [2020-07-01 12:59:27,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:59:27,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636389515] [2020-07-01 12:59:27,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:59:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:59:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:59:27,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:59:27,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:59:27,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:59:27,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:59:27,719 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-07-01 12:59:27,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:59:27,738 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2020-07-01 12:59:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:59:27,741 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:59:27,745 INFO L168 Benchmark]: Toolchain (without parser) took 4653.62 ms. Allocated memory was 649.6 MB in the beginning and 740.3 MB in the end (delta: 90.7 MB). Free memory was 561.7 MB in the beginning and 503.3 MB in the end (delta: 58.4 MB). Peak memory consumption was 149.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:27,745 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:59:27,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.94 ms. Allocated memory was 649.6 MB in the beginning and 670.6 MB in the end (delta: 21.0 MB). Free memory was 561.7 MB in the beginning and 632.6 MB in the end (delta: -70.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:27,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.94 ms. Allocated memory is still 670.6 MB. Free memory was 632.6 MB in the beginning and 629.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:27,747 INFO L168 Benchmark]: Boogie Preprocessor took 24.72 ms. Allocated memory is still 670.6 MB. Free memory was 629.9 MB in the beginning and 628.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:27,747 INFO L168 Benchmark]: RCFGBuilder took 294.86 ms. Allocated memory is still 670.6 MB. Free memory was 628.6 MB in the beginning and 608.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:27,748 INFO L168 Benchmark]: BlockEncodingV2 took 90.70 ms. Allocated memory is still 670.6 MB. Free memory was 608.9 MB in the beginning and 603.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:27,749 INFO L168 Benchmark]: TraceAbstraction took 3703.22 ms. Allocated memory was 670.6 MB in the beginning and 740.3 MB in the end (delta: 69.7 MB). Free memory was 602.1 MB in the beginning and 527.0 MB in the end (delta: 75.1 MB). Peak memory consumption was 144.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:27,749 INFO L168 Benchmark]: BuchiAutomizer took 168.24 ms. Allocated memory is still 740.3 MB. Free memory was 527.0 MB in the beginning and 503.3 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:59:27,753 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 18 locations, 23 edges - StatisticsResult: Encoded RCFG 12 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 324.94 ms. Allocated memory was 649.6 MB in the beginning and 670.6 MB in the end (delta: 21.0 MB). Free memory was 561.7 MB in the beginning and 632.6 MB in the end (delta: -70.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.94 ms. Allocated memory is still 670.6 MB. Free memory was 632.6 MB in the beginning and 629.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.72 ms. Allocated memory is still 670.6 MB. Free memory was 629.9 MB in the beginning and 628.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 294.86 ms. Allocated memory is still 670.6 MB. Free memory was 628.6 MB in the beginning and 608.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 90.70 ms. Allocated memory is still 670.6 MB. Free memory was 608.9 MB in the beginning and 603.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3703.22 ms. Allocated memory was 670.6 MB in the beginning and 740.3 MB in the end (delta: 69.7 MB). Free memory was 602.1 MB in the beginning and 527.0 MB in the end (delta: 75.1 MB). Peak memory consumption was 144.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 168.24 ms. Allocated memory is still 740.3 MB. Free memory was 527.0 MB in the beginning and 503.3 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2020-07-01 12:59:27,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:59:27,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((p == 0 && n <= unknown-#length-unknown[s]) && 1 == \valid[p]) && 1 == \valid[s]) && 1 <= n) && n <= unknown-#length-unknown[p]) && 1 <= n) && 0 == s) || (((((((n <= unknown-#length-unknown[s] && 1 == \valid[p]) && 1 == \valid[s]) && 1 <= p) && 1 <= n) && 1 <= n) && p + n <= unknown-#length-unknown[p]) && 0 == s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.4s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 SDtfs, 179 SDslu, 295 SDs, 0 SdLazy, 556 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 69 HoareAnnotationTreeSize, 1 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 144 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 7738 SizeOfPredicates, 27 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 21/46 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:59:19.767 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_zzHW0k/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:59:27.988 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check