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_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:55:40,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:55:40,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:55:40,407 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:55:40,407 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:55:40,408 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:55:40,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:55:40,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:55:40,416 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:55:40,417 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:55:40,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:55:40,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:55:40,420 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:55:40,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:55:40,422 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:55:40,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:55:40,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:55:40,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:55:40,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:55:40,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:55:40,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:55:40,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:55:40,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:55:40,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:55:40,435 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:55:40,436 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:55:40,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:55:40,437 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:55:40,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:55:40,439 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:55:40,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:55:40,440 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:55:40,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:55:40,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:55:40,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:55:40,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:55:40,443 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:55:40,467 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:55:40,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:55:40,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:55:40,469 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:55:40,470 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:55:40,470 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:55:40,470 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:55:40,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:55:40,470 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:55:40,472 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:55:40,472 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:55:40,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:55:40,472 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:55:40,472 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:55:40,473 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:55:40,473 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:55:40,473 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:55:40,473 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:55:40,473 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:55:40,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:55:40,475 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:55:40,475 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:55:40,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:55:40,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:40,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:55:40,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:55:40,476 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:55:40,476 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:55:40,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:55:40,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:55:40,477 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:55:40,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:55:40,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:55:40,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:55:40,550 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:55:40,551 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:55:40,551 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:55:40,617 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbdd6e4a/5a5c7994110b4588a797800016e65ea8/FLAG19e242482 [2018-11-23 12:55:41,170 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:55:41,170 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:55:41,183 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbdd6e4a/5a5c7994110b4588a797800016e65ea8/FLAG19e242482 [2018-11-23 12:55:41,475 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbdd6e4a/5a5c7994110b4588a797800016e65ea8 [2018-11-23 12:55:41,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:55:41,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:55:41,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:41,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:55:41,495 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:55:41,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:41" (1/1) ... [2018-11-23 12:55:41,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b6fda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:41, skipping insertion in model container [2018-11-23 12:55:41,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:41" (1/1) ... [2018-11-23 12:55:41,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:55:41,579 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:55:42,019 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:42,039 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:55:42,128 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:42,187 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:55:42,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42 WrapperNode [2018-11-23 12:55:42,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:42,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:42,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:55:42,189 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:55:42,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (1/1) ... [2018-11-23 12:55:42,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (1/1) ... [2018-11-23 12:55:42,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:42,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:55:42,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:55:42,324 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:55:42,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (1/1) ... [2018-11-23 12:55:42,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (1/1) ... [2018-11-23 12:55:42,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (1/1) ... [2018-11-23 12:55:42,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (1/1) ... [2018-11-23 12:55:42,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (1/1) ... [2018-11-23 12:55:42,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (1/1) ... [2018-11-23 12:55:42,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (1/1) ... [2018-11-23 12:55:42,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:55:42,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:55:42,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:55:42,421 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:55:42,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (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 12:55:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:55:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:55:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:55:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:55:42,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:55:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:55:42,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:55:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:55:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:55:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:55:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:55:42,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:55:43,775 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:55:43,776 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 12:55:43,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:43 BoogieIcfgContainer [2018-11-23 12:55:43,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:55:43,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:55:43,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:55:43,781 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:55:43,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:41" (1/3) ... [2018-11-23 12:55:43,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e8df81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:43, skipping insertion in model container [2018-11-23 12:55:43,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:42" (2/3) ... [2018-11-23 12:55:43,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e8df81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:43, skipping insertion in model container [2018-11-23 12:55:43,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:43" (3/3) ... [2018-11-23 12:55:43,785 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:55:43,794 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:55:43,802 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 12:55:43,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 12:55:43,851 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:55:43,852 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:55:43,852 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:55:43,853 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:55:43,853 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:55:43,853 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:55:43,854 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:55:43,854 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:55:43,854 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:55:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 12:55:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:55:43,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:43,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:43,888 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:43,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:43,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1487743693, now seen corresponding path program 1 times [2018-11-23 12:55:43,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:43,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:43,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:43,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:43,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:44,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 12:55:44,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45#true} is VALID [2018-11-23 12:55:44,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 12:55:44,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #155#return; {45#true} is VALID [2018-11-23 12:55:44,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret22 := main(); {45#true} is VALID [2018-11-23 12:55:44,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {45#true} is VALID [2018-11-23 12:55:44,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 12:55:44,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {46#false} is VALID [2018-11-23 12:55:44,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-23 12:55:44,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !(~x~0.base != 0 || ~x~0.offset != 0); {46#false} is VALID [2018-11-23 12:55:44,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 12:55:44,074 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 12:55:44,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:44,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:55:44,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 12:55:44,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:44,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:55:44,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:44,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:55:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:55:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:44,257 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 12:55:44,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:44,543 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2018-11-23 12:55:44,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:55:44,543 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 12:55:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2018-11-23 12:55:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2018-11-23 12:55:44,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 118 transitions. [2018-11-23 12:55:45,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:45,195 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:55:45,195 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:55:45,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 12:55:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:55:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 12:55:45,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:45,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:45,244 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:45,244 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:45,249 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 12:55:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:55:45,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:45,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:45,250 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:45,250 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:45,257 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 12:55:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:55:45,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:45,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:45,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:45,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:55:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-23 12:55:45,264 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 11 [2018-11-23 12:55:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:45,264 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 12:55:45,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:55:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:55:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:55:45,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:45,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:45,266 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:45,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash 164594329, now seen corresponding path program 1 times [2018-11-23 12:55:45,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:45,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:45,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:45,594 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-23 12:55:45,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-23 12:55:45,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {254#true} is VALID [2018-11-23 12:55:45,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-23 12:55:45,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #155#return; {254#true} is VALID [2018-11-23 12:55:45,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret22 := main(); {254#true} is VALID [2018-11-23 12:55:45,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {254#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:45,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:45,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:45,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {257#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:45,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {257#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {258#(not |main_#t~short7|)} is VALID [2018-11-23 12:55:45,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {258#(not |main_#t~short7|)} assume #t~short7;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;#t~short7 := 0 != #t~nondet6; {255#false} is VALID [2018-11-23 12:55:45,648 INFO L273 TraceCheckUtils]: 11: Hoare triple {255#false} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~nondet6;havoc #t~short7; {255#false} is VALID [2018-11-23 12:55:45,648 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#false} assume !(~x~0.base != 0 || ~x~0.offset != 0); {255#false} is VALID [2018-11-23 12:55:45,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-23 12:55:45,651 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 12:55:45,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:45,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:45,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:55:45,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:45,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:45,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:45,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:45,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:45,678 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 5 states. [2018-11-23 12:55:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:46,395 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2018-11-23 12:55:46,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:55:46,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:55:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:55:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:55:46,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2018-11-23 12:55:46,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:46,636 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:55:46,636 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:55:46,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:55:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:55:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-11-23 12:55:46,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:46,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 41 states. [2018-11-23 12:55:46,665 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 41 states. [2018-11-23 12:55:46,666 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 41 states. [2018-11-23 12:55:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:46,670 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:55:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:55:46,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:46,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:46,671 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 49 states. [2018-11-23 12:55:46,672 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 49 states. [2018-11-23 12:55:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:46,675 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:55:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:55:46,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:46,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:46,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:46,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:55:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 12:55:46,680 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 14 [2018-11-23 12:55:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:46,681 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 12:55:46,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:55:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:55:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:55:46,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:46,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:46,682 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:46,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash 164653911, now seen corresponding path program 1 times [2018-11-23 12:55:46,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:46,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:46,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:46,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:46,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2018-11-23 12:55:46,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {505#true} is VALID [2018-11-23 12:55:46,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2018-11-23 12:55:46,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #155#return; {505#true} is VALID [2018-11-23 12:55:46,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret22 := main(); {505#true} is VALID [2018-11-23 12:55:46,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {505#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {507#(not (= 0 main_~head~0.base))} is VALID [2018-11-23 12:55:46,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {507#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {507#(not (= 0 main_~head~0.base))} is VALID [2018-11-23 12:55:46,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {507#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {507#(not (= 0 main_~head~0.base))} is VALID [2018-11-23 12:55:46,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {507#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {508#(not (= 0 main_~x~0.base))} is VALID [2018-11-23 12:55:46,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {508#(not (= 0 main_~x~0.base))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {508#(not (= 0 main_~x~0.base))} is VALID [2018-11-23 12:55:46,822 INFO L273 TraceCheckUtils]: 10: Hoare triple {508#(not (= 0 main_~x~0.base))} assume !#t~short7; {508#(not (= 0 main_~x~0.base))} is VALID [2018-11-23 12:55:46,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {508#(not (= 0 main_~x~0.base))} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~nondet6;havoc #t~short7; {508#(not (= 0 main_~x~0.base))} is VALID [2018-11-23 12:55:46,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {508#(not (= 0 main_~x~0.base))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {506#false} is VALID [2018-11-23 12:55:46,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {506#false} assume !false; {506#false} is VALID [2018-11-23 12:55:46,824 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 12:55:46,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:46,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:55:46,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 12:55:46,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:46,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:55:46,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:46,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:55:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:55:46,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:55:46,849 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 4 states. [2018-11-23 12:55:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:47,187 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-23 12:55:47,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:55:47,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 12:55:47,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:55:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2018-11-23 12:55:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:55:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2018-11-23 12:55:47,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2018-11-23 12:55:47,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:47,316 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:55:47,316 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:55:47,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:55:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-11-23 12:55:47,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:47,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 48 states. [2018-11-23 12:55:47,378 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 48 states. [2018-11-23 12:55:47,378 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 48 states. [2018-11-23 12:55:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:47,381 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 12:55:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:55:47,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:47,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:47,383 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 54 states. [2018-11-23 12:55:47,383 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 54 states. [2018-11-23 12:55:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:47,386 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 12:55:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:55:47,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:47,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:47,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:47,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:55:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 12:55:47,391 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2018-11-23 12:55:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:47,391 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 12:55:47,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:55:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:55:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:55:47,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:47,393 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:47,393 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:47,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1416243916, now seen corresponding path program 1 times [2018-11-23 12:55:47,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:47,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:47,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:47,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-23 12:55:47,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {766#true} is VALID [2018-11-23 12:55:47,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-23 12:55:47,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #155#return; {766#true} is VALID [2018-11-23 12:55:47,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret22 := main(); {766#true} is VALID [2018-11-23 12:55:47,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {766#true} is VALID [2018-11-23 12:55:47,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {766#true} is VALID [2018-11-23 12:55:47,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {766#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); {766#true} is VALID [2018-11-23 12:55:47,553 INFO L273 TraceCheckUtils]: 8: Hoare triple {766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {766#true} is VALID [2018-11-23 12:55:47,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {766#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {766#true} is VALID [2018-11-23 12:55:47,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {766#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {766#true} is VALID [2018-11-23 12:55:47,555 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {768#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not |main_#t~short7|) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:47,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {768#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not |main_#t~short7|) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume #t~short7;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;#t~short7 := 0 != #t~nondet6; {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:47,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~nondet6;havoc #t~short7; {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:47,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:47,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} goto; {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:47,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} is VALID [2018-11-23 12:55:47,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} is VALID [2018-11-23 12:55:47,574 INFO L273 TraceCheckUtils]: 18: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} assume #t~short7;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;#t~short7 := 0 != #t~nondet6; {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} is VALID [2018-11-23 12:55:47,574 INFO L273 TraceCheckUtils]: 19: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~nondet6;havoc #t~short7; {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} is VALID [2018-11-23 12:55:47,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {767#false} is VALID [2018-11-23 12:55:47,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-23 12:55:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:55:47,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:55:47,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:55:47,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:47,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:55:47,996 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 23 treesize of output 21 [2018-11-23 12:55:48,018 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 12:55:48,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:48,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:48,091 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 16 treesize of output 12 [2018-11-23 12:55:48,101 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 12 treesize of output 4 [2018-11-23 12:55:48,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:48,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:48,157 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 23 treesize of output 19 [2018-11-23 12:55:48,167 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 12 treesize of output 4 [2018-11-23 12:55:48,173 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:48,179 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:48,196 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 12 treesize of output 10 [2018-11-23 12:55:48,200 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 12:55:48,202 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:48,205 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:48,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:55:48,232 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-11-23 12:55:48,247 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:48,248 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_2, v_prenex_3, v_prenex_4, v_prenex_1, |#memory_$Pointer$.base|, v_main_~x~0.base_33, v_main_~x~0.offset_33, |#memory_$Pointer$.offset|]. (or (let ((.cse0 (select (select v_prenex_1 v_prenex_3) v_prenex_4))) (and (not (= 0 .cse0)) (= main_~x~0.offset (select (select v_prenex_2 v_prenex_3) v_prenex_4)) (= .cse0 main_~x~0.base))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_33) v_main_~x~0.offset_33))) (and (not (= 0 .cse1)) (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_33) v_main_~x~0.offset_33) main_~x~0.base) (= main_~x~0.offset .cse1)))) [2018-11-23 12:55:48,248 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base))) [2018-11-23 12:55:48,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-23 12:55:48,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {766#true} is VALID [2018-11-23 12:55:48,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-23 12:55:48,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #155#return; {766#true} is VALID [2018-11-23 12:55:48,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret22 := main(); {766#true} is VALID [2018-11-23 12:55:48,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {766#true} is VALID [2018-11-23 12:55:48,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {766#true} is VALID [2018-11-23 12:55:48,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {766#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); {766#true} is VALID [2018-11-23 12:55:48,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {766#true} is VALID [2018-11-23 12:55:48,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {766#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {766#true} is VALID [2018-11-23 12:55:48,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {766#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {766#true} is VALID [2018-11-23 12:55:48,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {807#(or (and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not |main_#t~short7|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (and |main_#t~short7| (or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))))} is VALID [2018-11-23 12:55:48,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {807#(or (and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not |main_#t~short7|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (and |main_#t~short7| (or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))))} assume #t~short7;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;#t~short7 := 0 != #t~nondet6; {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:48,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume !!#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~nondet6;havoc #t~short7; {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:48,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:48,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} goto; {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:48,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {769#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} is VALID [2018-11-23 12:55:48,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} is VALID [2018-11-23 12:55:48,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} assume #t~short7;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;#t~short7 := 0 != #t~nondet6; {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} is VALID [2018-11-23 12:55:48,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~nondet6;havoc #t~short7; {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} is VALID [2018-11-23 12:55:48,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= main_~x~0.base 0)))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {767#false} is VALID [2018-11-23 12:55:48,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-23 12:55:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:55:48,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:55:48,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:55:48,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 12:55:48,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:48,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:55:48,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:48,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:55:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:55:48,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:55:48,397 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 6 states. [2018-11-23 12:55:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:49,047 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-23 12:55:49,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:55:49,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 12:55:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:55:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-11-23 12:55:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:55:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-11-23 12:55:49,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2018-11-23 12:55:49,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:49,185 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:55:49,185 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:55:49,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:55:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:55:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-11-23 12:55:49,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:49,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 38 states. [2018-11-23 12:55:49,274 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 38 states. [2018-11-23 12:55:49,274 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 38 states. [2018-11-23 12:55:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:49,277 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-23 12:55:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-23 12:55:49,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:49,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:49,278 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 50 states. [2018-11-23 12:55:49,278 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 50 states. [2018-11-23 12:55:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:49,281 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-23 12:55:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-23 12:55:49,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:49,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:49,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:49,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:55:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:55:49,285 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 22 [2018-11-23 12:55:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:49,286 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:55:49,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:55:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:55:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:55:49,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:49,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:49,287 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:49,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash -9431534, now seen corresponding path program 1 times [2018-11-23 12:55:49,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:49,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:49,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:49,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:49,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:49,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2018-11-23 12:55:49,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {1059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1059#true} is VALID [2018-11-23 12:55:49,493 INFO L273 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-23 12:55:49,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #155#return; {1059#true} is VALID [2018-11-23 12:55:49,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret22 := main(); {1059#true} is VALID [2018-11-23 12:55:49,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {1059#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:49,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:49,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:49,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:49,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:49,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !#t~short7; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:49,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~nondet6;havoc #t~short7; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:49,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:49,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} goto; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:49,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); {1063#(and (= 0 |main_#t~mem9.base|) (= |main_#t~mem9.offset| 0))} is VALID [2018-11-23 12:55:49,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {1063#(and (= 0 |main_#t~mem9.base|) (= |main_#t~mem9.offset| 0))} assume !(#t~mem9.base == 0 && #t~mem9.offset == 0);havoc #t~mem9.base, #t~mem9.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem13.base, 8 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset; {1060#false} is VALID [2018-11-23 12:55:49,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {1060#false} ~prev~0.base, ~prev~0.offset := 0, 0;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1060#false} is VALID [2018-11-23 12:55:49,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {1060#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~next~0.base, ~next~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~next~0.base, ~next~0.offset, ~x~0.base, 4 + ~x~0.offset, 4);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {1060#false} is VALID [2018-11-23 12:55:49,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {1060#false} assume !(~x~0.base != 0 || ~x~0.offset != 0); {1060#false} is VALID [2018-11-23 12:55:49,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {1060#false} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1060#false} is VALID [2018-11-23 12:55:49,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {1060#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem15 := read~int(~x~0.base, 8 + ~x~0.offset, 4);~t1~0 := #t~mem15;havoc #t~mem15;~t2~0 := 0; {1060#false} is VALID [2018-11-23 12:55:49,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {1060#false} assume 2 == ~t1~0;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem17 := read~int(#t~mem16.base, 8 + #t~mem16.offset, 4);~t2~0 := #t~mem17;havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem17; {1060#false} is VALID [2018-11-23 12:55:49,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {1060#false} assume !(2 != ~t1~0 || 1 == ~t2~0); {1060#false} is VALID [2018-11-23 12:55:49,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2018-11-23 12:55:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:55:49,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:49,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:49,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:55:49,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:49,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:49,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:49,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:49,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:49,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:49,567 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2018-11-23 12:55:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:50,063 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:55:50,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:55:50,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:55:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-23 12:55:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-23 12:55:50,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-23 12:55:50,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:50,205 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:55:50,206 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:55:50,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:55:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:55:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 12:55:50,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:50,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 12:55:50,249 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 12:55:50,249 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 12:55:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:50,251 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:55:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:55:50,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:50,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:50,254 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 12:55:50,255 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 12:55:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:50,263 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:55:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:55:50,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:50,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:50,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:50,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:55:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-23 12:55:50,271 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 24 [2018-11-23 12:55:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:50,272 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 12:55:50,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:55:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 12:55:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:55:50,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:50,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:50,273 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:50,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash -689489904, now seen corresponding path program 1 times [2018-11-23 12:55:50,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:50,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:50,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:50,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:50,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:50,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {1285#true} call ULTIMATE.init(); {1285#true} is VALID [2018-11-23 12:55:50,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {1285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1285#true} is VALID [2018-11-23 12:55:50,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {1285#true} assume true; {1285#true} is VALID [2018-11-23 12:55:50,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1285#true} {1285#true} #155#return; {1285#true} is VALID [2018-11-23 12:55:50,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {1285#true} call #t~ret22 := main(); {1285#true} is VALID [2018-11-23 12:55:50,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {1285#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:55:50,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:55:50,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} assume !(0 != #t~nondet1);havoc #t~nondet1; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:55:50,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:50,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:50,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !#t~short7; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:50,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~nondet6;havoc #t~short7; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:50,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:50,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} goto; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:50,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:50,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume #t~mem9.base == 0 && #t~mem9.offset == 0;havoc #t~mem9.base, #t~mem9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem11.base, 4 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);call write~int(2, ~x~0.base, 8 + ~x~0.offset, 4); {1289#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:50,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {1289#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} ~prev~0.base, ~prev~0.offset := 0, 0;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1290#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:50,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {1290#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~next~0.base, ~next~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~next~0.base, ~next~0.offset, ~x~0.base, 4 + ~x~0.offset, 4);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {1291#(not (= 0 main_~x~0.base))} is VALID [2018-11-23 12:55:50,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {1291#(not (= 0 main_~x~0.base))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {1286#false} is VALID [2018-11-23 12:55:50,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {1286#false} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1286#false} is VALID [2018-11-23 12:55:50,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {1286#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem15 := read~int(~x~0.base, 8 + ~x~0.offset, 4);~t1~0 := #t~mem15;havoc #t~mem15;~t2~0 := 0; {1286#false} is VALID [2018-11-23 12:55:50,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {1286#false} assume 2 == ~t1~0;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem17 := read~int(#t~mem16.base, 8 + #t~mem16.offset, 4);~t2~0 := #t~mem17;havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem17; {1286#false} is VALID [2018-11-23 12:55:50,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {1286#false} assume !(2 != ~t1~0 || 1 == ~t2~0); {1286#false} is VALID [2018-11-23 12:55:50,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {1286#false} assume !false; {1286#false} is VALID [2018-11-23 12:55:50,530 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 12:55:50,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:55:50,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:55:50,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:50,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:55:50,664 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 6 treesize of output 5 [2018-11-23 12:55:50,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:50,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:50,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:55:50,671 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:50,671 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_15|]. (= |#valid| (store |v_#valid_15| main_~head~0.base 1)) [2018-11-23 12:55:50,671 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~head~0.base)) [2018-11-23 12:55:50,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:50,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:50,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-11-23 12:55:50,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:50,861 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 164 treesize of output 93 [2018-11-23 12:55:50,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-11-23 12:55:50,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:50,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 62 treesize of output 56 [2018-11-23 12:55:50,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-23 12:55:50,948 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:50,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-23 12:55:51,006 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-11-23 12:55:51,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:51,019 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 31 treesize of output 40 [2018-11-23 12:55:51,023 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:51,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:51,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 50 [2018-11-23 12:55:51,080 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 12:55:51,110 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:55:51,147 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:55:51,175 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:55:51,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:55:51,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 12:55:51,327 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:179, output treesize:102 [2018-11-23 12:55:51,340 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:51,341 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_30|, |main_#t~malloc10.base|, |main_#t~malloc10.offset|, main_~x~0.offset, |v_#valid_16|]. (and (not (= |main_#t~malloc10.base| 0)) (= 0 (select |v_#valid_16| |main_#t~malloc10.base|)) (= 1 (select |v_#valid_16| main_~head~0.base)) (= |#memory_$Pointer$.base| (let ((.cse0 (let ((.cse3 (store |v_#memory_$Pointer$.base_30| main_~head~0.base (store (select |v_#memory_$Pointer$.base_30| main_~head~0.base) main_~head~0.offset |main_#t~malloc10.base|)))) (store .cse3 |main_#t~malloc10.base| (store (select .cse3 |main_#t~malloc10.base|) (+ |main_#t~malloc10.offset| 4) main_~head~0.base))))) (let ((.cse1 (select (select .cse0 main_~head~0.base) main_~head~0.offset))) (store .cse0 .cse1 (let ((.cse2 (+ main_~x~0.offset 8))) (store (store (select .cse0 .cse1) main_~x~0.offset 0) .cse2 (select (select |#memory_$Pointer$.base| .cse1) .cse2)))))))) [2018-11-23 12:55:51,341 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~x~0.offset, v_prenex_7, v_prenex_6, |main_#t~malloc10.offset|]. (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (let ((.cse0 (not (= .cse3 main_~head~0.base))) (.cse1 (not (= .cse3 0))) (.cse2 (select |#memory_$Pointer$.base| .cse3))) (or (and .cse0 .cse1 (= (select .cse2 (+ v_prenex_6 4)) 0)) (and (= (select .cse2 (+ |main_#t~malloc10.offset| (- 4))) 0) .cse0 .cse1) (and .cse0 (= (select .cse2 main_~x~0.offset) 0) .cse1 (= (select .cse2 (+ v_prenex_7 4)) main_~head~0.base))))) [2018-11-23 12:56:19,497 WARN L180 SmtUtils]: Spent 28.13 s on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 12:56:47,796 WARN L180 SmtUtils]: Spent 28.05 s on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 12:56:47,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-11-23 12:56:47,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 9 [2018-11-23 12:56:47,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:47,935 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 7 treesize of output 1 [2018-11-23 12:56:47,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:47,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:47,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:47,960 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:123, output treesize:9 [2018-11-23 12:56:47,970 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:47,970 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_11, v_prenex_10, v_subst_1, v_prenex_7, v_prenex_9, v_prenex_8, v_prenex_6, |v_#memory_$Pointer$.base_31|, v_main_~x~0.offset_35, |main_#t~malloc10.offset|]. (or (let ((.cse0 (select (select v_prenex_9 main_~prev~0.base) v_prenex_8))) (and (not (= .cse0 0)) (not (= main_~prev~0.base .cse0)) (= 0 (select (select v_prenex_9 .cse0) (+ v_prenex_6 4))) (= .cse0 main_~x~0.base))) (let ((.cse2 (select (select v_prenex_11 main_~prev~0.base) v_prenex_10))) (let ((.cse1 (select v_prenex_11 .cse2))) (and (= (select .cse1 v_subst_1) 0) (= main_~prev~0.base (select .cse1 (+ v_prenex_7 4))) (not (= main_~prev~0.base .cse2)) (not (= .cse2 0)) (= .cse2 main_~x~0.base)))) (let ((.cse3 (select (select |v_#memory_$Pointer$.base_31| main_~prev~0.base) v_main_~x~0.offset_35))) (and (not (= main_~prev~0.base .cse3)) (= 0 (select (select |v_#memory_$Pointer$.base_31| .cse3) (+ |main_#t~malloc10.offset| (- 4)))) (not (= .cse3 0)) (= .cse3 main_~x~0.base)))) [2018-11-23 12:56:47,970 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= 0 main_~x~0.base)) (not (= main_~prev~0.base main_~x~0.base))) [2018-11-23 12:56:48,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {1285#true} call ULTIMATE.init(); {1285#true} is VALID [2018-11-23 12:56:48,056 INFO L273 TraceCheckUtils]: 1: Hoare triple {1285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1285#true} is VALID [2018-11-23 12:56:48,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {1285#true} assume true; {1285#true} is VALID [2018-11-23 12:56:48,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1285#true} {1285#true} #155#return; {1285#true} is VALID [2018-11-23 12:56:48,057 INFO L256 TraceCheckUtils]: 4: Hoare triple {1285#true} call #t~ret22 := main(); {1285#true} is VALID [2018-11-23 12:56:48,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {1285#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:56:48,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:56:48,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} assume !(0 != #t~nondet1);havoc #t~nondet1; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:56:48,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:56:48,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:56:48,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !#t~short7; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:56:48,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !#t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~nondet6;havoc #t~short7; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:56:48,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:56:48,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} goto; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:56:48,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:56:48,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume #t~mem9.base == 0 && #t~mem9.offset == 0;havoc #t~mem9.base, #t~mem9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem11.base, 4 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);call write~int(2, ~x~0.base, 8 + ~x~0.offset, 4); {1340#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (exists ((|main_#t~malloc10.offset| Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ |main_#t~malloc10.offset| (- 4))) 0))) (and (exists ((v_prenex_6 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ v_prenex_6 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (exists ((v_prenex_7 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ v_prenex_7 4)) main_~head~0.base)) (exists ((main_~x~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) 0))))} is VALID [2018-11-23 12:56:48,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {1340#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (exists ((|main_#t~malloc10.offset| Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ |main_#t~malloc10.offset| (- 4))) 0))) (and (exists ((v_prenex_6 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ v_prenex_6 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (exists ((v_prenex_7 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ v_prenex_7 4)) main_~head~0.base)) (exists ((main_~x~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) 0))))} ~prev~0.base, ~prev~0.offset := 0, 0;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1344#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (exists ((|main_#t~malloc10.offset| Int)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ |main_#t~malloc10.offset| (- 4))))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))) (and (exists ((v_prenex_6 Int)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ v_prenex_6 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))) (and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) v_subst_1) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (exists ((v_prenex_7 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ v_prenex_7 4)) main_~x~0.base))))} is VALID [2018-11-23 12:56:48,102 INFO L273 TraceCheckUtils]: 17: Hoare triple {1344#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (exists ((|main_#t~malloc10.offset| Int)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ |main_#t~malloc10.offset| (- 4))))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))) (and (exists ((v_prenex_6 Int)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ v_prenex_6 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))) (and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) v_subst_1) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (exists ((v_prenex_7 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ v_prenex_7 4)) main_~x~0.base))))} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~next~0.base, ~next~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~next~0.base, ~next~0.offset, ~x~0.base, 4 + ~x~0.offset, 4);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {1348#(and (not (= 0 main_~x~0.base)) (not (= main_~prev~0.base main_~x~0.base)))} is VALID [2018-11-23 12:56:48,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {1348#(and (not (= 0 main_~x~0.base)) (not (= main_~prev~0.base main_~x~0.base)))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {1286#false} is VALID [2018-11-23 12:56:48,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {1286#false} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1286#false} is VALID [2018-11-23 12:56:48,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {1286#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem15 := read~int(~x~0.base, 8 + ~x~0.offset, 4);~t1~0 := #t~mem15;havoc #t~mem15;~t2~0 := 0; {1286#false} is VALID [2018-11-23 12:56:48,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {1286#false} assume 2 == ~t1~0;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem17 := read~int(#t~mem16.base, 8 + #t~mem16.offset, 4);~t2~0 := #t~mem17;havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem17; {1286#false} is VALID [2018-11-23 12:56:48,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {1286#false} assume !(2 != ~t1~0 || 1 == ~t2~0); {1286#false} is VALID [2018-11-23 12:56:48,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {1286#false} assume !false; {1286#false} is VALID [2018-11-23 12:56:48,117 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 12:56:48,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:48,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 12:56:48,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 12:56:48,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:48,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:56:48,193 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 12:56:48,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:56:48,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:56:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:56:48,195 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 10 states. [2018-11-23 12:57:16,622 WARN L180 SmtUtils]: Spent 28.06 s on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 12:58:13,152 WARN L180 SmtUtils]: Spent 56.13 s on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2018-11-23 12:58:42,572 WARN L180 SmtUtils]: Spent 28.05 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 12:58:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:42,959 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2018-11-23 12:58:42,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:58:42,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 12:58:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:58:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2018-11-23 12:58:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:58:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2018-11-23 12:58:42,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2018-11-23 12:58:43,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:43,303 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:58:43,303 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:58:43,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 169.0s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:58:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:58:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 64. [2018-11-23 12:58:43,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:43,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 64 states. [2018-11-23 12:58:43,442 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 64 states. [2018-11-23 12:58:43,442 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 64 states. [2018-11-23 12:58:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:43,446 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2018-11-23 12:58:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-11-23 12:58:43,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:43,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:43,447 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 107 states. [2018-11-23 12:58:43,448 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 107 states. [2018-11-23 12:58:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:43,452 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2018-11-23 12:58:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-11-23 12:58:43,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:43,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:43,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:43,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:58:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-11-23 12:58:43,455 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 24 [2018-11-23 12:58:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:43,456 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-23 12:58:43,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:58:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-11-23 12:58:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:58:43,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:43,457 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:43,457 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:43,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1695473247, now seen corresponding path program 2 times [2018-11-23 12:58:43,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:43,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:43,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:43,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:43,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:44,013 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) 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 12:58:44,017 INFO L168 Benchmark]: Toolchain (without parser) took 182528.36 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 863.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -495.3 MB). Peak memory consumption was 367.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:44,018 INFO L168 Benchmark]: CDTParser took 0.50 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 12:58:44,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:44,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:44,020 INFO L168 Benchmark]: Boogie Preprocessor took 96.28 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:58:44,021 INFO L168 Benchmark]: RCFGBuilder took 1357.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:44,021 INFO L168 Benchmark]: TraceAbstraction took 180237.69 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.8 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 245.9 MB). Peak memory consumption was 370.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:58:44,026 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.50 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 697.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 134.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.28 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1357.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 180237.69 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.8 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 245.9 MB). Peak memory consumption was 370.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...