java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:20:15,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:20:15,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:20:15,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:20:15,435 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:20:15,436 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:20:15,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:20:15,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:20:15,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:20:15,441 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:20:15,442 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:20:15,442 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:20:15,443 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:20:15,444 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:20:15,446 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:20:15,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:20:15,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:20:15,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:20:15,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:20:15,453 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:20:15,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:20:15,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:20:15,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:20:15,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:20:15,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:20:15,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:20:15,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:20:15,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:20:15,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:20:15,462 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:20:15,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:20:15,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:20:15,464 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:20:15,464 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:20:15,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:20:15,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:20:15,466 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:20:15,484 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:20:15,485 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:20:15,485 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:20:15,486 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:20:15,486 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:20:15,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:20:15,487 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:20:15,487 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:20:15,487 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:20:15,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:20:15,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:20:15,488 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:20:15,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:20:15,491 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:20:15,491 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:20:15,492 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:20:15,492 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:20:15,492 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:20:15,492 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:20:15,492 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:20:15,493 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:20:15,493 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:20:15,493 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:20:15,493 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:20:15,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:20:15,494 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:20:15,494 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:20:15,494 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:20:15,494 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:20:15,494 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:20:15,494 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:20:15,496 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:20:15,497 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:20:15,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:20:15,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:20:15,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:20:15,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:20:15,581 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:20:15,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-23 11:20:15,639 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d164165/c42eb1fd7e7b42e5a3c3ee96e59b2586/FLAGd91c1a80b [2018-11-23 11:20:16,130 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:20:16,131 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-23 11:20:16,144 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d164165/c42eb1fd7e7b42e5a3c3ee96e59b2586/FLAGd91c1a80b [2018-11-23 11:20:16,427 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d164165/c42eb1fd7e7b42e5a3c3ee96e59b2586 [2018-11-23 11:20:16,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:20:16,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:20:16,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:20:16,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:20:16,445 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:20:16,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:20:16" (1/1) ... [2018-11-23 11:20:16,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38574617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:16, skipping insertion in model container [2018-11-23 11:20:16,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:20:16" (1/1) ... [2018-11-23 11:20:16,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:20:16,514 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:20:16,951 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:20:16,978 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:20:17,126 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:20:17,182 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:20:17,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17 WrapperNode [2018-11-23 11:20:17,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:20:17,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:20:17,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:20:17,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:20:17,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... [2018-11-23 11:20:17,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... [2018-11-23 11:20:17,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:20:17,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:20:17,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:20:17,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:20:17,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... [2018-11-23 11:20:17,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... [2018-11-23 11:20:17,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... [2018-11-23 11:20:17,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... [2018-11-23 11:20:17,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... [2018-11-23 11:20:17,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... [2018-11-23 11:20:17,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... [2018-11-23 11:20:17,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:20:17,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:20:17,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:20:17,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:20:17,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:20:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:20:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:20:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:20:17,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:20:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:20:17,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:20:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:20:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:20:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:20:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:20:17,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:20:18,986 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:20:18,986 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:20:18,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:20:18 BoogieIcfgContainer [2018-11-23 11:20:18,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:20:18,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:20:18,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:20:18,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:20:18,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:20:16" (1/3) ... [2018-11-23 11:20:18,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204a28c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:20:18, skipping insertion in model container [2018-11-23 11:20:18,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:20:17" (2/3) ... [2018-11-23 11:20:18,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204a28c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:20:18, skipping insertion in model container [2018-11-23 11:20:18,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:20:18" (3/3) ... [2018-11-23 11:20:18,995 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2018-11-23 11:20:19,006 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:20:19,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:20:19,033 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:20:19,064 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:20:19,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:20:19,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:20:19,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:20:19,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:20:19,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:20:19,065 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:20:19,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:20:19,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:20:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:20:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:20:19,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:19,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:19,092 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:19,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1233287634, now seen corresponding path program 1 times [2018-11-23 11:20:19,104 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:19,104 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:19,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:20:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:19,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:19,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:20:19,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {24#true} is VALID [2018-11-23 11:20:19,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:20:19,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #56#return; {24#true} is VALID [2018-11-23 11:20:19,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret16 := main(); {24#true} is VALID [2018-11-23 11:20:19,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {24#true} is VALID [2018-11-23 11:20:19,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 11:20:19,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {25#false} is VALID [2018-11-23 11:20:19,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume !true; {25#false} is VALID [2018-11-23 11:20:19,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {25#false} is VALID [2018-11-23 11:20:19,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume !(100bv32 == #t~mem15);havoc #t~mem15; {25#false} is VALID [2018-11-23 11:20:19,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:20:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:19,273 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:20:19,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:20:19,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:20:19,283 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:20:19,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:19,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:20:19,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:19,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:20:19,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:20:19,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:20:19,353 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 11:20:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:20,306 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-23 11:20:20,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:20:20,307 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:20:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:20:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:20:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2018-11-23 11:20:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:20:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2018-11-23 11:20:20,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 43 transitions. [2018-11-23 11:20:20,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:20,568 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:20:20,569 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:20:20,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:20:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:20:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:20:20,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:20:20,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:20:20,616 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:20:20,616 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:20:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:20,620 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-23 11:20:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-23 11:20:20,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:20,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:20,621 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:20:20,621 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:20:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:20,624 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-23 11:20:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-23 11:20:20,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:20,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:20,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:20:20,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:20:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:20:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 11:20:20,630 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2018-11-23 11:20:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:20:20,631 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 11:20:20,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:20:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-23 11:20:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:20:20,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:20,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:20,632 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:20,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:20,633 INFO L82 PathProgramCache]: Analyzing trace with hash -721210670, now seen corresponding path program 1 times [2018-11-23 11:20:20,633 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:20,634 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:20,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:20:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:20,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:21,021 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 11:20:21,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:20:21,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:21,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 11:20:21,327 INFO L478 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 8 treesize of output 7 [2018-11-23 11:20:21,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:21,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 11:20:21,535 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:20:21,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:21,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 11:20:21,570 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:21,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:21,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:21,870 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:21,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 11:20:21,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:21,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 11:20:21,995 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:22,012 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:22,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:22,027 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:66, output treesize:19 [2018-11-23 11:20:22,089 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:22,090 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, |main_#t~malloc3.base|, main_~head~0.offset, |v_#memory_int_21|, |v_#valid_12|]. (let ((.cse2 (select |v_#memory_int_21| |main_#t~malloc3.base|))) (and (= (let ((.cse0 (store |v_#memory_int_22| main_~m~0.base (store (select |v_#memory_int_22| main_~m~0.base) main_~m~0.offset (_ bv0 32))))) (store .cse0 |main_#t~malloc3.base| (let ((.cse1 (bvadd main_~head~0.offset (_ bv4 32)))) (store (store (select .cse0 |main_#t~malloc3.base|) main_~head~0.offset (_ bv1 32)) .cse1 (select .cse2 .cse1))))) |v_#memory_int_21|) (= (_ bv0 1) (select (store |v_#valid_12| main_~m~0.base (_ bv1 1)) |main_#t~malloc3.base|)) (= (store |v_#memory_int_21| |main_#t~malloc3.base| (let ((.cse3 (bvadd main_~head~0.offset (_ bv8 32)))) (store .cse2 .cse3 (select (select |#memory_int| |main_#t~malloc3.base|) .cse3)))) |#memory_int|))) [2018-11-23 11:20:22,090 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc3.base|, main_~head~0.offset]. (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))) [2018-11-23 11:20:22,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 11:20:22,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-23 11:20:22,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:22,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 11:20:22,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:22,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:22,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:22,264 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 11:20:22,269 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:22,269 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~m~0.base, main_~m~0.offset, |main_#t~malloc3.base|, main_~head~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)) (= .cse0 (_ bv0 32)) (= .cse0 |main_#t~mem7|))) [2018-11-23 11:20:22,270 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) |main_#t~mem7|) [2018-11-23 11:20:22,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {159#true} is VALID [2018-11-23 11:20:22,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {159#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {159#true} is VALID [2018-11-23 11:20:22,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2018-11-23 11:20:22,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2018-11-23 11:20:22,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret16 := main(); {159#true} is VALID [2018-11-23 11:20:22,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {159#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {179#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} is VALID [2018-11-23 11:20:22,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {179#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {179#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} is VALID [2018-11-23 11:20:22,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {179#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {179#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} is VALID [2018-11-23 11:20:22,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {189#(= (_ bv0 32) |main_#t~mem7|)} is VALID [2018-11-23 11:20:22,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {189#(= (_ bv0 32) |main_#t~mem7|)} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {160#false} is VALID [2018-11-23 11:20:22,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {160#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {160#false} is VALID [2018-11-23 11:20:22,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {160#false} assume !(100bv32 == #t~mem15);havoc #t~mem15; {160#false} is VALID [2018-11-23 11:20:22,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {160#false} assume !false; {160#false} is VALID [2018-11-23 11:20:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:22,478 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:20:22,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:20:22,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:20:22,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 11:20:22,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:22,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:20:22,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:22,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:20:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:20:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:20:22,824 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2018-11-23 11:20:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:24,912 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 11:20:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:20:24,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 11:20:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:20:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:20:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-23 11:20:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:20:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-23 11:20:24,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2018-11-23 11:20:25,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:25,337 INFO L225 Difference]: With dead ends: 28 [2018-11-23 11:20:25,337 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:20:25,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:20:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:20:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 11:20:25,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:20:25,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 11:20:25,361 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:20:25,361 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:20:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:25,363 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-11-23 11:20:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-11-23 11:20:25,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:25,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:25,365 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:20:25,365 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:20:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:25,367 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-11-23 11:20:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-11-23 11:20:25,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:25,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:25,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:20:25,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:20:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:20:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-23 11:20:25,371 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2018-11-23 11:20:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:20:25,372 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-23 11:20:25,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:20:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-11-23 11:20:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:20:25,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:25,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:25,373 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:25,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:25,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1619586799, now seen corresponding path program 1 times [2018-11-23 11:20:25,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:25,374 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:25,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:20:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:25,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:25,669 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:20:25,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:25,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 11:20:25,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 11:20:25,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,913 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:25,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:26,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-23 11:20:26,021 INFO L478 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 8 treesize of output 7 [2018-11-23 11:20:26,022 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 11:20:26,088 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-23 11:20:26,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:26,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-23 11:20:26,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:26,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:26,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:26,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-23 11:20:26,287 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,312 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,327 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,358 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,381 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:26,416 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:75, output treesize:29 [2018-11-23 11:20:28,442 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:28,442 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, main_~head~0.offset, |v_#memory_int_23|, |v_#valid_13|]. (let ((.cse1 (select |v_#memory_int_23| main_~list~0.base)) (.cse0 (store |v_#valid_13| main_~m~0.base (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 main_~list~0.base)) (= |#memory_int| (store |v_#memory_int_23| main_~list~0.base (let ((.cse2 (bvadd main_~head~0.offset (_ bv8 32)))) (store .cse1 .cse2 (select (select |#memory_int| main_~list~0.base) .cse2))))) (= (let ((.cse3 (store |v_#memory_int_26| main_~m~0.base (store (select |v_#memory_int_26| main_~m~0.base) main_~m~0.offset (_ bv0 32))))) (store .cse3 main_~list~0.base (let ((.cse4 (bvadd main_~head~0.offset (_ bv4 32)))) (store (store (select .cse3 main_~list~0.base) main_~head~0.offset (_ bv1 32)) .cse4 (select .cse1 .cse4))))) |v_#memory_int_23|) (= |#valid| (store .cse0 main_~list~0.base (_ bv1 1))))) [2018-11-23 11:20:28,443 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~head~0.offset]. (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base))) [2018-11-23 11:20:28,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:28,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:28,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:28,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:20:28,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:28,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:29,086 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:29,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:29,378 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-11-23 11:20:29,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-11-23 11:20:29,398 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 11:20:29,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:29,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-11-23 11:20:29,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:29,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:29,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:29,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-23 11:20:29,492 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:29,545 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:29,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:29,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 66 [2018-11-23 11:20:29,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 11:20:29,805 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-23 11:20:29,905 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:30,011 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:30,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:30,177 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 10 variables, input treesize:94, output treesize:27 [2018-11-23 11:20:30,247 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:30,248 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, |main_#t~malloc6.base|, main_~n~0.offset, main_~x~0, |v_#memory_int_24|, |v_#valid_14|, |v_#memory_int_25|, main_~list~0.base, main_~list~0.offset, main_~head~0.offset]. (let ((.cse0 (select |v_#memory_int_24| |main_#t~malloc6.base|))) (and (= (select |v_#valid_14| |main_#t~malloc6.base|) (_ bv0 1)) (= (select (select |v_#memory_int_27| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (store |v_#memory_int_24| |main_#t~malloc6.base| (let ((.cse1 (bvadd main_~n~0.offset (_ bv8 32)))) (store .cse0 .cse1 (select (select |v_#memory_int_25| |main_#t~malloc6.base|) .cse1)))) |v_#memory_int_25|) (= |v_#memory_int_24| (store |v_#memory_int_27| |main_#t~malloc6.base| (let ((.cse2 (bvadd main_~n~0.offset (_ bv4 32)))) (store (store (select |v_#memory_int_27| |main_#t~malloc6.base|) main_~n~0.offset main_~x~0) .cse2 (select .cse0 .cse2))))) (= (_ bv1 1) (select |v_#valid_14| main_~list~0.base)) (= (select |v_#valid_14| main_~m~0.base) (_ bv1 1)) (not (= main_~m~0.base main_~list~0.base)) (= |#memory_int| (store |v_#memory_int_25| main_~list~0.base (let ((.cse3 (bvadd main_~list~0.offset (_ bv8 32)))) (store (select |v_#memory_int_25| main_~list~0.base) .cse3 (select (select |#memory_int| main_~list~0.base) .cse3))))) (= (_ bv1 32) (select (select |v_#memory_int_27| main_~list~0.base) main_~head~0.offset)))) [2018-11-23 11:20:30,248 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~list~0.base, main_~head~0.offset]. (let ((.cse0 (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)))) (or .cse0 (and .cse0 (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~list~0.base))))) [2018-11-23 11:20:30,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:20:30,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-23 11:20:30,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:30,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:30,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:30,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 11:20:30,307 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:30,307 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~m~0.base, main_~m~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (= .cse0 (_ bv0 32)) (= .cse0 |main_#t~mem7|))) [2018-11-23 11:20:30,307 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) |main_#t~mem7|) [2018-11-23 11:20:30,321 INFO L256 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {319#true} is VALID [2018-11-23 11:20:30,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {319#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {319#true} is VALID [2018-11-23 11:20:30,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {319#true} assume true; {319#true} is VALID [2018-11-23 11:20:30,322 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} #56#return; {319#true} is VALID [2018-11-23 11:20:30,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {319#true} call #t~ret16 := main(); {319#true} is VALID [2018-11-23 11:20:31,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {319#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {339#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((main_~head~0.offset (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset))) (not (= main_~m~0.base main_~list~0.base)))} is VALID [2018-11-23 11:20:31,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((main_~head~0.offset (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset))) (not (= main_~m~0.base main_~list~0.base)))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;~x~0 := #t~nondet5;havoc #t~nondet5; {339#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((main_~head~0.offset (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset))) (not (= main_~m~0.base main_~list~0.base)))} is VALID [2018-11-23 11:20:31,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((main_~head~0.offset (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset))) (not (= main_~m~0.base main_~list~0.base)))} assume ~bvsgt32(~x~0, 0bv32) && ~bvslt32(~x~0, 10bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(~x~0, ~n~0.base, ~n~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); {346#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} is VALID [2018-11-23 11:20:31,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {346#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {346#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} is VALID [2018-11-23 11:20:31,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {346#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {346#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} is VALID [2018-11-23 11:20:31,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {346#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {356#(= (_ bv0 32) |main_#t~mem7|)} is VALID [2018-11-23 11:20:31,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#(= (_ bv0 32) |main_#t~mem7|)} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {320#false} is VALID [2018-11-23 11:20:31,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {320#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {320#false} is VALID [2018-11-23 11:20:31,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {320#false} assume !(100bv32 == #t~mem15);havoc #t~mem15; {320#false} is VALID [2018-11-23 11:20:31,099 INFO L273 TraceCheckUtils]: 14: Hoare triple {320#false} assume !false; {320#false} is VALID [2018-11-23 11:20:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:31,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:31,305 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:31,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:31,483 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:31,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:31,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:31,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:31,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:31,707 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:77, output treesize:60 [2018-11-23 11:20:31,970 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:31,970 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_main_~n~0.base_2, v_main_~n~0.offset_2, main_~x~0, |v_#memory_int_24|, |v_#memory_int_28|, main_~list~0.offset, |v_#memory_int_25|]. (let ((.cse1 (select |v_#memory_int_24| v_main_~n~0.base_2))) (or (not (= |v_#memory_int_28| (store |v_#memory_int_25| main_~list~0.base (let ((.cse0 (bvadd main_~list~0.offset (_ bv8 32)))) (store (select |v_#memory_int_25| main_~list~0.base) .cse0 (select (select |v_#memory_int_28| main_~list~0.base) .cse0)))))) (not (= (store |v_#memory_int_24| v_main_~n~0.base_2 (let ((.cse2 (bvadd v_main_~n~0.offset_2 (_ bv8 32)))) (store .cse1 .cse2 (select (select |v_#memory_int_25| v_main_~n~0.base_2) .cse2)))) |v_#memory_int_25|)) (bvslt (select (select |v_#memory_int_28| main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (= (store |#memory_int| v_main_~n~0.base_2 (let ((.cse3 (bvadd v_main_~n~0.offset_2 (_ bv4 32)))) (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) .cse3 (select .cse1 .cse3)))) |v_#memory_int_24|)) (not (= (select |#valid| v_main_~n~0.base_2) (_ bv0 1))))) [2018-11-23 11:20:31,971 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~n~0.base_2, v_main_~n~0.offset_2, main_~x~0, v_DerPreprocessor_8, v_DerPreprocessor_10, main_~list~0.offset, v_DerPreprocessor_12]. (or (not (= (select |#valid| v_main_~n~0.base_2) (_ bv0 1))) (bvslt (select (select (let ((.cse0 (store |#memory_int| v_main_~n~0.base_2 (store (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)))) (store .cse0 main_~list~0.base (store (select .cse0 main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)) v_DerPreprocessor_12))) main_~m~0.base) main_~m~0.offset) (_ bv100 32))) [2018-11-23 11:20:33,986 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_main_~n~0.base_2 (_ BitVec 32)) (v_main_~n~0.offset_2 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (main_~x~0 (_ BitVec 32)) (main_~list~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (select |c_#valid| v_main_~n~0.base_2) (_ bv0 1))) (bvslt (select (select (let ((.cse0 (store |c_#memory_int| v_main_~n~0.base_2 (store (store (store (select |c_#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)))) (store .cse0 c_main_~list~0.base (store (select .cse0 c_main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)) v_DerPreprocessor_12))) c_main_~m~0.base) c_main_~m~0.offset) (_ bv100 32)))) is different from false [2018-11-23 11:20:34,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {320#false} assume !false; {320#false} is VALID [2018-11-23 11:20:34,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {320#false} assume !(100bv32 == #t~mem15);havoc #t~mem15; {320#false} is VALID [2018-11-23 11:20:34,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {320#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {320#false} is VALID [2018-11-23 11:20:34,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {378#(bvslt |main_#t~mem7| (_ bv100 32))} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {320#false} is VALID [2018-11-23 11:20:34,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {382#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {378#(bvslt |main_#t~mem7| (_ bv100 32))} is VALID [2018-11-23 11:20:34,092 INFO L273 TraceCheckUtils]: 9: Hoare triple {382#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {382#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-23 11:20:34,092 INFO L273 TraceCheckUtils]: 8: Hoare triple {382#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {382#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-23 11:20:36,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {392#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_main_~n~0.base_2 (_ BitVec 32)) (v_main_~n~0.offset_2 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (main_~x~0 (_ BitVec 32)) (main_~list~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~n~0.base_2) (_ bv0 1))) (bvslt (select (select (store (store |#memory_int| v_main_~n~0.base_2 (store (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)) main_~list~0.base (store (select (store |#memory_int| v_main_~n~0.base_2 (store (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)) v_DerPreprocessor_12)) main_~m~0.base) main_~m~0.offset) (_ bv100 32))))} assume ~bvsgt32(~x~0, 0bv32) && ~bvslt32(~x~0, 10bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(~x~0, ~n~0.base, ~n~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); {382#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is UNKNOWN [2018-11-23 11:20:36,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {392#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_main_~n~0.base_2 (_ BitVec 32)) (v_main_~n~0.offset_2 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (main_~x~0 (_ BitVec 32)) (main_~list~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~n~0.base_2) (_ bv0 1))) (bvslt (select (select (store (store |#memory_int| v_main_~n~0.base_2 (store (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)) main_~list~0.base (store (select (store |#memory_int| v_main_~n~0.base_2 (store (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)) v_DerPreprocessor_12)) main_~m~0.base) main_~m~0.offset) (_ bv100 32))))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;~x~0 := #t~nondet5;havoc #t~nondet5; {392#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_main_~n~0.base_2 (_ BitVec 32)) (v_main_~n~0.offset_2 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (main_~x~0 (_ BitVec 32)) (main_~list~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~n~0.base_2) (_ bv0 1))) (bvslt (select (select (store (store |#memory_int| v_main_~n~0.base_2 (store (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)) main_~list~0.base (store (select (store |#memory_int| v_main_~n~0.base_2 (store (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)) v_DerPreprocessor_12)) main_~m~0.base) main_~m~0.offset) (_ bv100 32))))} is VALID [2018-11-23 11:20:36,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {319#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {392#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_main_~n~0.base_2 (_ BitVec 32)) (v_main_~n~0.offset_2 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (main_~x~0 (_ BitVec 32)) (main_~list~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~n~0.base_2) (_ bv0 1))) (bvslt (select (select (store (store |#memory_int| v_main_~n~0.base_2 (store (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)) main_~list~0.base (store (select (store |#memory_int| v_main_~n~0.base_2 (store (store (store (select |#memory_int| v_main_~n~0.base_2) v_main_~n~0.offset_2 main_~x~0) (bvadd v_main_~n~0.offset_2 (_ bv4 32)) v_DerPreprocessor_8) (bvadd v_main_~n~0.offset_2 (_ bv8 32)) v_DerPreprocessor_10)) main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)) v_DerPreprocessor_12)) main_~m~0.base) main_~m~0.offset) (_ bv100 32))))} is VALID [2018-11-23 11:20:36,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {319#true} call #t~ret16 := main(); {319#true} is VALID [2018-11-23 11:20:36,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} #56#return; {319#true} is VALID [2018-11-23 11:20:36,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {319#true} assume true; {319#true} is VALID [2018-11-23 11:20:36,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {319#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {319#true} is VALID [2018-11-23 11:20:36,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {319#true} is VALID [2018-11-23 11:20:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 11:20:36,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:20:36,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:20:36,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 11:20:36,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:36,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:20:38,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:38,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:20:38,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:20:38,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-11-23 11:20:38,474 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 8 states. [2018-11-23 11:20:42,255 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 23 [2018-11-23 11:20:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:45,539 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2018-11-23 11:20:45,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:20:45,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 11:20:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:20:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:20:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-23 11:20:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:20:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-23 11:20:45,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2018-11-23 11:20:46,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:46,517 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:20:46,518 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:20:46,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=29, Invalid=46, Unknown=1, NotChecked=14, Total=90 [2018-11-23 11:20:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:20:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-11-23 11:20:46,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:20:46,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 26 states. [2018-11-23 11:20:46,550 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 26 states. [2018-11-23 11:20:46,550 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 26 states. [2018-11-23 11:20:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:46,554 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2018-11-23 11:20:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-11-23 11:20:46,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:46,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:46,555 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 33 states. [2018-11-23 11:20:46,555 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 33 states. [2018-11-23 11:20:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:46,558 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2018-11-23 11:20:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-11-23 11:20:46,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:46,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:46,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:20:46,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:20:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:20:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-11-23 11:20:46,562 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2018-11-23 11:20:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:20:46,562 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-23 11:20:46,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:20:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2018-11-23 11:20:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:20:46,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:46,563 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:46,564 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:46,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:46,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2093125143, now seen corresponding path program 1 times [2018-11-23 11:20:46,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:46,565 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:46,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:20:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:46,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:46,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 11:20:46,809 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:20:46,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:46,842 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:46,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-11-23 11:20:46,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:46,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:47,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:47,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 11:20:47,307 INFO L478 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 8 treesize of output 7 [2018-11-23 11:20:47,310 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:47,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:47,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 60 [2018-11-23 11:20:47,538 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-11-23 11:20:47,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:47,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2018-11-23 11:20:47,603 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:47,668 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:47,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:47,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2018-11-23 11:20:47,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:47,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 11:20:47,876 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:47,919 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:48,006 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:48,102 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:48,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 11:20:48,308 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:20:48,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:48,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 11:20:48,330 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:48,351 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:48,369 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:48,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-23 11:20:48,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:48,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-23 11:20:48,497 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:48,511 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:48,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:48,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:48,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:48,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 74 [2018-11-23 11:20:48,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:48,718 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 55 [2018-11-23 11:20:48,726 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:48,762 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:48,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:48,815 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:100, output treesize:117 [2018-11-23 11:20:52,224 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:52,225 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|, |v_#memory_int_30|, |v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_22|]. (let ((.cse1 (bvadd main_~head~0.offset (_ bv8 32))) (.cse2 (select |v_#memory_int_30| main_~head~0.base)) (.cse0 (bvadd main_~head~0.offset (_ bv4 32)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_22| main_~head~0.base (store (store (select |v_#memory_$Pointer$.base_22| main_~head~0.base) .cse0 main_~m~0.base) .cse1 main_~head~0.base))) (= (store |v_#memory_$Pointer$.offset_22| main_~head~0.base (store (store (select |v_#memory_$Pointer$.offset_22| main_~head~0.base) .cse0 main_~m~0.offset) .cse1 main_~head~0.offset)) |#memory_$Pointer$.offset|) (= (store |v_#memory_int_30| main_~head~0.base (store .cse2 .cse1 (select (select |#memory_int| main_~head~0.base) .cse1))) |#memory_int|) (= (let ((.cse3 (store |v_#memory_int_31| main_~m~0.base (store (select |v_#memory_int_31| main_~m~0.base) main_~m~0.offset (_ bv0 32))))) (store .cse3 main_~head~0.base (store (store (select .cse3 main_~head~0.base) main_~head~0.offset (_ bv1 32)) .cse0 (select .cse2 .cse0)))) |v_#memory_int_30|) (= (_ bv0 32) main_~m~0.offset) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:20:52,225 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse10 (select |#memory_$Pointer$.base| main_~head~0.base)) (.cse8 (bvadd main_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse10 .cse8)) (.cse7 (select |#memory_$Pointer$.offset| main_~head~0.base)) (.cse9 (bvadd main_~head~0.offset (_ bv8 32)))) (let ((.cse1 (= (select .cse10 .cse9) main_~head~0.base)) (.cse2 (= (_ bv0 32) main_~m~0.offset)) (.cse3 (= main_~head~0.offset (select .cse7 .cse9))) (.cse4 (= (select .cse7 .cse8) main_~head~0.offset)) (.cse5 (= .cse0 main_~m~0.base)) (.cse6 (= (_ bv0 32) main_~head~0.offset))) (or (and (= (_ bv0 32) (select (select |#memory_int| .cse0) main_~m~0.offset)) .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) .cse6) (and (= (select (select |#memory_int| main_~m~0.base) main_~head~0.offset) (_ bv1 32)) .cse1 .cse2 .cse3 (= main_~m~0.base main_~head~0.base) .cse4 .cse5 .cse6))))) [2018-11-23 11:20:52,357 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:20:52,549 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 11:20:52,762 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:20:52,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:52,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:52,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:52,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 110 [2018-11-23 11:20:53,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:53,071 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 101 [2018-11-23 11:20:53,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 11:20:53,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:53,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2018-11-23 11:20:53,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2018-11-23 11:20:53,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:53,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:53,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2018-11-23 11:20:53,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 33 [2018-11-23 11:20:53,518 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:53,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:53,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-11-23 11:20:53,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-11-23 11:20:53,853 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:53,874 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:53,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:53,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2018-11-23 11:20:54,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:54,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2018-11-23 11:20:54,003 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:54,018 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:54,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 11:20:54,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-23 11:20:54,165 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:54,172 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:54,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:54,293 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:176, output treesize:42 [2018-11-23 11:20:56,373 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:56,373 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_3, main_~list~0.base, v_prenex_2, v_prenex_1, |v_#memory_$Pointer$.base_23|, |v_#memory_int_32|, |v_#memory_$Pointer$.offset_23|]. (let ((.cse5 (= (_ bv0 32) main_~m~0.offset))) (or (let ((.cse1 (select |v_#memory_$Pointer$.base_23| main_~m~0.base)) (.cse6 (select |v_#memory_$Pointer$.offset_23| main_~m~0.base))) (let ((.cse0 (select (select |v_#memory_int_32| main_~m~0.base) (_ bv0 32))) (.cse3 (select .cse6 (_ bv4 32))) (.cse2 (select .cse1 (_ bv4 32)))) (and (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~m~0.base (select .cse1 (_ bv8 32))) (= .cse2 main_~m~0.base) (= .cse3 (_ bv0 32)) (= |#memory_int| (store |v_#memory_int_32| .cse2 (let ((.cse4 (select |v_#memory_int_32| .cse2))) (store .cse4 .cse3 (bvadd .cse0 (select .cse4 .cse3)))))) .cse5 (= (select .cse6 (_ bv8 32)) (_ bv0 32))))) (let ((.cse11 (select v_prenex_3 main_~list~0.base))) (let ((.cse7 (select .cse11 (_ bv4 32))) (.cse12 (select v_prenex_1 main_~list~0.base))) (let ((.cse9 (select .cse12 (_ bv4 32))) (.cse10 (select (select v_prenex_2 main_~list~0.base) (_ bv0 32))) (.cse8 (select v_prenex_2 .cse7))) (and (= (store v_prenex_2 .cse7 (store .cse8 .cse9 (bvadd (select .cse8 .cse9) .cse10))) |#memory_int|) (= .cse9 (_ bv0 32)) (= (bvadd .cse10 (_ bv4294967295 32)) (_ bv0 32)) (= main_~m~0.base .cse7) (= main_~list~0.base (select .cse11 (_ bv8 32))) (= (_ bv0 32) (select .cse8 main_~m~0.offset)) .cse5 (= (select .cse12 (_ bv8 32)) (_ bv0 32)))))))) [2018-11-23 11:20:56,374 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~list~0.base]. (let ((.cse0 (select |#memory_int| main_~m~0.base)) (.cse1 (= (_ bv0 32) main_~m~0.offset))) (or (and (= (_ bv2 32) (select .cse0 (_ bv0 32))) .cse1) (let ((.cse2 (select (select |#memory_int| main_~list~0.base) (_ bv0 32)))) (and (= (select .cse0 main_~m~0.offset) (bvadd .cse2 main_~m~0.offset)) .cse1 (= (_ bv0 32) (bvadd .cse2 (_ bv4294967295 32))) (not (= main_~m~0.base main_~list~0.base)))))) [2018-11-23 11:20:56,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {569#true} call ULTIMATE.init(); {569#true} is VALID [2018-11-23 11:20:56,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {569#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {569#true} is VALID [2018-11-23 11:20:56,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {569#true} assume true; {569#true} is VALID [2018-11-23 11:20:56,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} #56#return; {569#true} is VALID [2018-11-23 11:20:56,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {569#true} call #t~ret16 := main(); {569#true} is VALID [2018-11-23 11:20:56,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {569#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {589#(or (and (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~head~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~m~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-23 11:20:56,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {589#(or (and (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~head~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~m~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {589#(or (and (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~head~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~m~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-23 11:20:56,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {589#(or (and (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~head~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~m~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {596#(or (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv1 32) (select (select |#memory_int| main_~m~0.base) main_~list~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~m~0.base main_~list~0.base) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} is VALID [2018-11-23 11:20:56,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {596#(or (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv1 32) (select (select |#memory_int| main_~m~0.base) main_~list~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~m~0.base main_~list~0.base) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {600#(and (or (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv1 32) (select (select |#memory_int| main_~m~0.base) main_~list~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~m~0.base main_~list~0.base) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))))) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|))} is VALID [2018-11-23 11:20:56,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {600#(and (or (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv1 32) (select (select |#memory_int| main_~m~0.base) main_~list~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~m~0.base main_~list~0.base) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))))) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|))} assume !!~bvslt32(#t~mem7, 100bv32);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call #t~mem9 := read~intINTTYPE4(#t~mem8.base, #t~mem8.offset, 4bv32);call #t~mem10 := read~intINTTYPE4(~list~0.base, ~list~0.offset, 4bv32); {596#(or (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv1 32) (select (select |#memory_int| main_~m~0.base) main_~list~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~m~0.base main_~list~0.base) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} is VALID [2018-11-23 11:20:56,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {596#(or (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv1 32) (select (select |#memory_int| main_~m~0.base) main_~list~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= main_~m~0.base main_~list~0.base) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} assume ~bvsle32(~bvadd32(#t~mem9, #t~mem10), 100bv32);havoc #t~mem9;havoc #t~mem10;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call #t~mem12 := read~intINTTYPE4(#t~mem11.base, #t~mem11.offset, 4bv32);call #t~mem13 := read~intINTTYPE4(~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem12, #t~mem13), #t~mem11.base, #t~mem11.offset, 4bv32);havoc #t~mem12;havoc #t~mem13;havoc #t~mem11.base, #t~mem11.offset; {607#(or (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv0 32) main_~m~0.offset) (exists ((main_~list~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| main_~list~0.base) (_ bv0 32)) main_~m~0.offset)) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) (_ bv0 32))) (not (= main_~m~0.base main_~list~0.base))))))} is VALID [2018-11-23 11:20:56,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {607#(or (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv0 32) main_~m~0.offset) (exists ((main_~list~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| main_~list~0.base) (_ bv0 32)) main_~m~0.offset)) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) (_ bv0 32))) (not (= main_~m~0.base main_~list~0.base))))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {607#(or (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv0 32) main_~m~0.offset) (exists ((main_~list~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| main_~list~0.base) (_ bv0 32)) main_~m~0.offset)) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) (_ bv0 32))) (not (= main_~m~0.base main_~list~0.base))))))} is VALID [2018-11-23 11:20:56,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {607#(or (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv0 32) main_~m~0.offset) (exists ((main_~list~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| main_~list~0.base) (_ bv0 32)) main_~m~0.offset)) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) (_ bv0 32))) (not (= main_~m~0.base main_~list~0.base))))))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {614#(or (and (= (_ bv0 32) main_~m~0.offset) (exists ((main_~list~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| main_~list~0.base) (_ bv0 32)) main_~m~0.offset)) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) (_ bv0 32))) (not (= main_~m~0.base main_~list~0.base)))) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|)) (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|)))} is VALID [2018-11-23 11:20:56,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {614#(or (and (= (_ bv0 32) main_~m~0.offset) (exists ((main_~list~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| main_~list~0.base) (_ bv0 32)) main_~m~0.offset)) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) (_ bv0 32))) (not (= main_~m~0.base main_~list~0.base)))) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|)) (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|)))} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {570#false} is VALID [2018-11-23 11:20:56,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {570#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {570#false} is VALID [2018-11-23 11:20:56,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {570#false} assume !(100bv32 == #t~mem15);havoc #t~mem15; {570#false} is VALID [2018-11-23 11:20:56,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {570#false} assume !false; {570#false} is VALID [2018-11-23 11:20:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:56,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:57,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {570#false} assume !false; {570#false} is VALID [2018-11-23 11:20:57,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#(= (bvadd |main_#t~mem15| (_ bv4294967196 32)) (_ bv0 32))} assume !(100bv32 == #t~mem15);havoc #t~mem15; {570#false} is VALID [2018-11-23 11:20:57,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {634#(= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32))} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {630#(= (bvadd |main_#t~mem15| (_ bv4294967196 32)) (_ bv0 32))} is VALID [2018-11-23 11:20:57,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {638#(or (bvslt |main_#t~mem7| (_ bv100 32)) (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {634#(= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32))} is VALID [2018-11-23 11:20:57,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {642#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {638#(or (bvslt |main_#t~mem7| (_ bv100 32)) (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:57,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {642#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-23 11:20:57,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {649#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} assume ~bvsle32(~bvadd32(#t~mem9, #t~mem10), 100bv32);havoc #t~mem9;havoc #t~mem10;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call #t~mem12 := read~intINTTYPE4(#t~mem11.base, #t~mem11.offset, 4bv32);call #t~mem13 := read~intINTTYPE4(~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem12, #t~mem13), #t~mem11.base, #t~mem11.offset, 4bv32);havoc #t~mem12;havoc #t~mem13;havoc #t~mem11.base, #t~mem11.offset; {642#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-23 11:20:57,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {653#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt |main_#t~mem7| (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} assume !!~bvslt32(#t~mem7, 100bv32);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call #t~mem9 := read~intINTTYPE4(#t~mem8.base, #t~mem8.offset, 4bv32);call #t~mem10 := read~intINTTYPE4(~list~0.base, ~list~0.offset, 4bv32); {649#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:57,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {657#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {653#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt |main_#t~mem7| (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:57,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {661#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {657#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:57,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {661#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {661#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-23 11:20:57,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {569#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {661#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-23 11:20:57,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {569#true} call #t~ret16 := main(); {569#true} is VALID [2018-11-23 11:20:57,959 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} #56#return; {569#true} is VALID [2018-11-23 11:20:57,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {569#true} assume true; {569#true} is VALID [2018-11-23 11:20:57,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {569#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {569#true} is VALID [2018-11-23 11:20:57,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {569#true} call ULTIMATE.init(); {569#true} is VALID [2018-11-23 11:20:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:57,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:20:57,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-23 11:20:57,965 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-11-23 11:20:57,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:57,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:20:58,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:58,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:20:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:20:58,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:20:58,160 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 15 states. [2018-11-23 11:21:03,525 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2018-11-23 11:21:08,811 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 11:21:09,594 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-11-23 11:21:10,339 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 11:21:18,848 WARN L180 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-11-23 11:21:19,633 WARN L180 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-23 11:21:20,481 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-11-23 11:21:21,510 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-11-23 11:21:24,259 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:21:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:24,630 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2018-11-23 11:21:24,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:21:24,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-11-23 11:21:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:21:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2018-11-23 11:21:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:21:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2018-11-23 11:21:24,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 63 transitions. [2018-11-23 11:21:24,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:24,982 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:21:24,983 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:21:24,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:21:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:21:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-11-23 11:21:25,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:25,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 34 states. [2018-11-23 11:21:25,119 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 34 states. [2018-11-23 11:21:25,120 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 34 states. [2018-11-23 11:21:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:25,123 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-23 11:21:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-23 11:21:25,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:25,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:25,124 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 44 states. [2018-11-23 11:21:25,125 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 44 states. [2018-11-23 11:21:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:25,127 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-23 11:21:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-23 11:21:25,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:25,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:25,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:25,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:21:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2018-11-23 11:21:25,131 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 17 [2018-11-23 11:21:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:25,131 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-23 11:21:25,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:21:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2018-11-23 11:21:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:21:25,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:25,132 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:21:25,133 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:25,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash 563091404, now seen corresponding path program 2 times [2018-11-23 11:21:25,133 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:25,134 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:25,155 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:21:25,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:21:25,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:21:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:25,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:25,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:25,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 11:21:25,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 11:21:25,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:25,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:25,659 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:25,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:25,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-23 11:21:25,770 INFO L478 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 8 treesize of output 7 [2018-11-23 11:21:25,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:25,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 11:21:25,895 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-23 11:21:25,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:25,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-23 11:21:25,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:25,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:25,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:25,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-23 11:21:25,949 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:25,969 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:25,985 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,009 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,032 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:26,064 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:75, output treesize:29 [2018-11-23 11:21:28,075 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:28,076 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|, main_~head~0.offset, |v_#memory_int_35|, |v_#valid_24|]. (let ((.cse1 (select |v_#memory_int_35| main_~list~0.base)) (.cse0 (store |v_#valid_24| main_~m~0.base (_ bv1 1)))) (and (= (select .cse0 main_~list~0.base) (_ bv0 1)) (= |#memory_int| (store |v_#memory_int_35| main_~list~0.base (let ((.cse2 (bvadd main_~head~0.offset (_ bv8 32)))) (store .cse1 .cse2 (select (select |#memory_int| main_~list~0.base) .cse2))))) (= |v_#memory_int_35| (let ((.cse3 (store |v_#memory_int_40| main_~m~0.base (store (select |v_#memory_int_40| main_~m~0.base) main_~m~0.offset (_ bv0 32))))) (store .cse3 main_~list~0.base (let ((.cse4 (bvadd main_~head~0.offset (_ bv4 32)))) (store (store (select .cse3 main_~list~0.base) main_~head~0.offset (_ bv1 32)) .cse4 (select .cse1 .cse4)))))) (= (store .cse0 main_~list~0.base (_ bv1 1)) |#valid|))) [2018-11-23 11:21:28,076 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~head~0.offset]. (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base))) [2018-11-23 11:21:28,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:28,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:28,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:28,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 11:21:28,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:28,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:28,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:29,246 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-11-23 11:21:29,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 11:21:29,278 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-23 11:21:29,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:29,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-23 11:21:29,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:29,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:29,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:29,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-23 11:21:29,411 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:29,453 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:29,484 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:29,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:29,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 57 [2018-11-23 11:21:29,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 11:21:29,863 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 11:21:29,924 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:21:30,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 11:21:30,079 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:100, output treesize:78 [2018-11-23 11:21:30,287 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:30,288 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, |main_#t~malloc6.base|, main_~n~0.offset, main_~x~0, |v_#memory_int_36|, |v_#valid_25|, main_~head~0.offset, |v_#memory_int_37|]. (let ((.cse1 (select |v_#memory_int_36| |main_#t~malloc6.base|))) (and (= |#valid| (store |v_#valid_25| |main_#t~malloc6.base| (_ bv1 1))) (= (_ bv1 32) (select (select |v_#memory_int_41| main_~list~0.base) main_~head~0.offset)) (= (select |v_#valid_25| main_~list~0.base) (_ bv1 1)) (= (select (select |v_#memory_int_41| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv0 1) (select |v_#valid_25| |main_#t~malloc6.base|)) (= (_ bv1 1) (select |v_#valid_25| main_~m~0.base)) (= |v_#memory_int_36| (store |v_#memory_int_41| |main_#t~malloc6.base| (let ((.cse0 (bvadd main_~n~0.offset (_ bv4 32)))) (store (store (select |v_#memory_int_41| |main_#t~malloc6.base|) main_~n~0.offset main_~x~0) .cse0 (select .cse1 .cse0))))) (= (store |v_#memory_int_36| |main_#t~malloc6.base| (let ((.cse2 (bvadd main_~n~0.offset (_ bv8 32)))) (store .cse1 .cse2 (select (select |v_#memory_int_37| |main_#t~malloc6.base|) .cse2)))) |v_#memory_int_37|) (not (= main_~m~0.base main_~list~0.base)) (= (store |v_#memory_int_37| main_~list~0.base (let ((.cse3 (bvadd main_~list~0.offset (_ bv8 32)))) (store (select |v_#memory_int_37| main_~list~0.base) .cse3 (select (select |#memory_int| main_~list~0.base) .cse3)))) |#memory_int|))) [2018-11-23 11:21:30,288 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_5, main_~head~0.offset, |main_#t~malloc6.base|]. (let ((.cse0 (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))) (.cse1 (= (_ bv1 1) (select |#valid| main_~m~0.base))) (.cse2 (= (_ bv1 1) (select |#valid| main_~list~0.base))) (.cse3 (not (= main_~m~0.base main_~list~0.base)))) (or (and (not (= v_prenex_5 main_~list~0.base)) .cse0 (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)) .cse1 .cse2 (= (_ bv1 1) (select |#valid| v_prenex_5)) .cse3) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) .cse0 (not (= |main_#t~malloc6.base| main_~m~0.base)) .cse1 .cse2 (= (_ bv1 1) (select |#valid| |main_#t~malloc6.base|)) .cse3))) [2018-11-23 11:21:30,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:30,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:30,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:30,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:30,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-23 11:21:30,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:30,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 11:21:30,930 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:21:30,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:30,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 11:21:30,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,212 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:31,233 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:31,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-11-23 11:21:31,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:31,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 11:21:31,497 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2018-11-23 11:21:31,630 INFO L478 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 16 treesize of output 1 [2018-11-23 11:21:31,631 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,663 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,687 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,753 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:100, output treesize:7 [2018-11-23 11:21:31,835 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:31,835 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, |main_#t~malloc6.base|, main_~n~0.offset, main_~x~0, |v_#memory_int_38|, |v_#valid_26|, v_subst_1, main_~list~0.base, main_~list~0.offset, |v_#memory_int_39|]. (let ((.cse1 (select |v_#memory_int_38| |main_#t~malloc6.base|))) (and (= (_ bv1 1) (select |v_#valid_26| v_subst_1)) (not (= v_subst_1 main_~list~0.base)) (= (store |v_#memory_int_42| |main_#t~malloc6.base| (let ((.cse0 (bvadd main_~n~0.offset (_ bv4 32)))) (store (store (select |v_#memory_int_42| |main_#t~malloc6.base|) main_~n~0.offset main_~x~0) .cse0 (select .cse1 .cse0)))) |v_#memory_int_38|) (= (store |v_#memory_int_39| main_~list~0.base (let ((.cse2 (bvadd main_~list~0.offset (_ bv8 32)))) (store (select |v_#memory_int_39| main_~list~0.base) .cse2 (select (select |#memory_int| main_~list~0.base) .cse2)))) |#memory_int|) (= (select (select |v_#memory_int_42| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (not (= v_subst_1 main_~m~0.base)) (= (select |v_#valid_26| main_~list~0.base) (_ bv1 1)) (= (_ bv0 1) (select |v_#valid_26| |main_#t~malloc6.base|)) (= (select |v_#valid_26| main_~m~0.base) (_ bv1 1)) (not (= main_~m~0.base main_~list~0.base)) (= |v_#memory_int_39| (store |v_#memory_int_38| |main_#t~malloc6.base| (let ((.cse3 (bvadd main_~n~0.offset (_ bv8 32)))) (store .cse1 .cse3 (select (select |v_#memory_int_39| |main_#t~malloc6.base|) .cse3))))))) [2018-11-23 11:21:31,836 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) [2018-11-23 11:21:31,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:21:31,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-23 11:21:31,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:31,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 11:21:31,875 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:31,876 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~m~0.base, main_~m~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (= .cse0 (_ bv0 32)) (= .cse0 |main_#t~mem7|))) [2018-11-23 11:21:31,876 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) |main_#t~mem7|) [2018-11-23 11:21:31,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2018-11-23 11:21:31,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {905#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {905#true} is VALID [2018-11-23 11:21:31,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2018-11-23 11:21:31,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #56#return; {905#true} is VALID [2018-11-23 11:21:31,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret16 := main(); {905#true} is VALID [2018-11-23 11:21:32,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {905#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {925#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((main_~head~0.offset (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset))) (not (= main_~m~0.base main_~list~0.base)))} is VALID [2018-11-23 11:21:32,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {925#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((main_~head~0.offset (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset))) (not (= main_~m~0.base main_~list~0.base)))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;~x~0 := #t~nondet5;havoc #t~nondet5; {925#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((main_~head~0.offset (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset))) (not (= main_~m~0.base main_~list~0.base)))} is VALID [2018-11-23 11:21:32,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {925#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((main_~head~0.offset (_ BitVec 32))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~head~0.offset))) (not (= main_~m~0.base main_~list~0.base)))} assume ~bvsgt32(~x~0, 0bv32) && ~bvslt32(~x~0, 10bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(~x~0, ~n~0.base, ~n~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); {932#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((|main_#t~malloc6.base| (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= |main_#t~malloc6.base| main_~m~0.base)) (= (_ bv1 1) (select |#valid| |main_#t~malloc6.base|)))) (not (= main_~m~0.base main_~list~0.base)))} is VALID [2018-11-23 11:21:32,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {932#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((|main_#t~malloc6.base| (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= |main_#t~malloc6.base| main_~m~0.base)) (= (_ bv1 1) (select |#valid| |main_#t~malloc6.base|)))) (not (= main_~m~0.base main_~list~0.base)))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;~x~0 := #t~nondet5;havoc #t~nondet5; {932#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((|main_#t~malloc6.base| (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= |main_#t~malloc6.base| main_~m~0.base)) (= (_ bv1 1) (select |#valid| |main_#t~malloc6.base|)))) (not (= main_~m~0.base main_~list~0.base)))} is VALID [2018-11-23 11:21:32,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {932#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~m~0.base)) (= (_ bv1 1) (select |#valid| main_~list~0.base)) (exists ((|main_#t~malloc6.base| (_ BitVec 32))) (and (not (= |main_#t~malloc6.base| main_~list~0.base)) (not (= |main_#t~malloc6.base| main_~m~0.base)) (= (_ bv1 1) (select |#valid| |main_#t~malloc6.base|)))) (not (= main_~m~0.base main_~list~0.base)))} assume ~bvsgt32(~x~0, 0bv32) && ~bvslt32(~x~0, 10bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(~x~0, ~n~0.base, ~n~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); {939#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} is VALID [2018-11-23 11:21:32,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {939#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {939#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} is VALID [2018-11-23 11:21:32,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {939#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {939#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} is VALID [2018-11-23 11:21:32,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {939#(= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {949#(= (_ bv0 32) |main_#t~mem7|)} is VALID [2018-11-23 11:21:32,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {949#(= (_ bv0 32) |main_#t~mem7|)} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {906#false} is VALID [2018-11-23 11:21:32,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {906#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {906#false} is VALID [2018-11-23 11:21:32,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {906#false} assume !(100bv32 == #t~mem15);havoc #t~mem15; {906#false} is VALID [2018-11-23 11:21:32,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {906#false} assume !false; {906#false} is VALID [2018-11-23 11:21:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:32,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:21:32,380 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:32,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:32,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:32,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:32,859 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:32,861 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2018-11-23 11:21:32,867 INFO L168 Benchmark]: Toolchain (without parser) took 76429.46 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -234.6 MB). Peak memory consumption was 620.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:21:32,868 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:21:32,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.0 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:21:32,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.60 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:21:32,869 INFO L168 Benchmark]: Boogie Preprocessor took 45.75 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:21:32,869 INFO L168 Benchmark]: RCFGBuilder took 1716.22 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:21:32,869 INFO L168 Benchmark]: TraceAbstraction took 73877.33 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 133.2 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 497.4 MB). Peak memory consumption was 630.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:21:32,872 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.0 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.60 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.75 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1716.22 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73877.33 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 133.2 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 497.4 MB). Peak memory consumption was 630.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...