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/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:56:37,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:56:37,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:56:37,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:56:37,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:56:37,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:56:37,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:56:37,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:56:37,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:56:37,440 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:56:37,441 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:56:37,442 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:56:37,443 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:56:37,444 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:56:37,448 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:56:37,449 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:56:37,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:56:37,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:56:37,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:56:37,468 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:56:37,469 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:56:37,471 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:56:37,473 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:56:37,473 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:56:37,474 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:56:37,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:56:37,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:56:37,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:56:37,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:56:37,478 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:56:37,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:56:37,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:56:37,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:56:37,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:56:37,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:56:37,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:56:37,481 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:56:37,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:56:37,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:56:37,500 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:56:37,501 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:56:37,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:56:37,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:56:37,502 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:56:37,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:56:37,502 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:56:37,502 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:56:37,502 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:56:37,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:56:37,503 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:56:37,503 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:56:37,503 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:56:37,503 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:56:37,504 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:56:37,504 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:56:37,504 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:56:37,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:56:37,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:56:37,505 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:56:37,505 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:56:37,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:56:37,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:56:37,505 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:56:37,506 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:56:37,506 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:56:37,506 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:56:37,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:56:37,506 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:56:37,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:56:37,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:56:37,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:56:37,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:56:37,597 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:56:37,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:56:37,663 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021281107/8069b38bfce14ee6978072c4304d8202/FLAGa34aea786 [2018-11-23 12:56:38,176 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:56:38,177 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:56:38,195 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021281107/8069b38bfce14ee6978072c4304d8202/FLAGa34aea786 [2018-11-23 12:56:38,453 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021281107/8069b38bfce14ee6978072c4304d8202 [2018-11-23 12:56:38,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:56:38,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:56:38,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:38,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:56:38,471 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:56:38,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:38" (1/1) ... [2018-11-23 12:56:38,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f288c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:38, skipping insertion in model container [2018-11-23 12:56:38,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:38" (1/1) ... [2018-11-23 12:56:38,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:56:38,547 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:56:39,034 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:39,045 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:56:39,126 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:39,191 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:56:39,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39 WrapperNode [2018-11-23 12:56:39,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:39,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:39,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:56:39,194 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:56:39,275 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:56:39" (1/1) ... [2018-11-23 12:56:39,293 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:56:39" (1/1) ... [2018-11-23 12:56:39,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:39,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:56:39,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:56:39,303 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:56:39,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39" (1/1) ... [2018-11-23 12:56:39,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39" (1/1) ... [2018-11-23 12:56:39,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39" (1/1) ... [2018-11-23 12:56:39,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39" (1/1) ... [2018-11-23 12:56:39,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39" (1/1) ... [2018-11-23 12:56:39,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39" (1/1) ... [2018-11-23 12:56:39,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39" (1/1) ... [2018-11-23 12:56:39,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:56:39,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:56:39,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:56:39,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:56:39,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39" (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:56:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-11-23 12:56:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-11-23 12:56:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-23 12:56:39,439 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-23 12:56:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:56:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:56:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-11-23 12:56:39,440 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-11-23 12:56:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:56:39,441 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:56:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:56:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:56:39,441 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:56:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:56:39,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:56:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:56:39,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:56:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:56:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:56:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-23 12:56:39,442 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-23 12:56:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:56:39,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:56:39,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:56:40,544 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:56:40,545 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:56:40,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:40 BoogieIcfgContainer [2018-11-23 12:56:40,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:56:40,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:56:40,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:56:40,550 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:56:40,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:56:38" (1/3) ... [2018-11-23 12:56:40,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66730892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:40, skipping insertion in model container [2018-11-23 12:56:40,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:39" (2/3) ... [2018-11-23 12:56:40,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66730892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:40, skipping insertion in model container [2018-11-23 12:56:40,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:40" (3/3) ... [2018-11-23 12:56:40,559 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:56:40,570 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:56:40,579 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:56:40,599 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:56:40,646 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:56:40,647 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:56:40,647 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:56:40,647 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:56:40,647 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:56:40,647 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:56:40,647 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:56:40,648 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:56:40,648 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:56:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-23 12:56:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:56:40,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:40,681 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:40,684 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:40,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1670761163, now seen corresponding path program 1 times [2018-11-23 12:56:40,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:40,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:40,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:40,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {63#true} is VALID [2018-11-23 12:56:40,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {63#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {63#true} is VALID [2018-11-23 12:56:40,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-23 12:56:40,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #153#return; {63#true} is VALID [2018-11-23 12:56:40,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret17 := main(); {63#true} is VALID [2018-11-23 12:56:40,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {63#true} ~len~0 := 2;~data~0 := 1; {63#true} is VALID [2018-11-23 12:56:40,904 INFO L256 TraceCheckUtils]: 6: Hoare triple {63#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {63#true} is VALID [2018-11-23 12:56:40,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {63#true} ~len := #in~len;~data := #in~data; {63#true} is VALID [2018-11-23 12:56:40,905 INFO L256 TraceCheckUtils]: 8: Hoare triple {63#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {63#true} is VALID [2018-11-23 12:56:40,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {63#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {63#true} is VALID [2018-11-23 12:56:40,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {63#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {63#true} is VALID [2018-11-23 12:56:40,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {63#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {63#true} is VALID [2018-11-23 12:56:40,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-23 12:56:40,910 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {63#true} {63#true} #149#return; {63#true} is VALID [2018-11-23 12:56:40,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {63#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {63#true} is VALID [2018-11-23 12:56:40,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {63#true} assume !true; {64#false} is VALID [2018-11-23 12:56:40,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {64#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {64#false} is VALID [2018-11-23 12:56:40,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {64#false} assume true; {64#false} is VALID [2018-11-23 12:56:40,926 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {64#false} {63#true} #141#return; {64#false} is VALID [2018-11-23 12:56:40,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {64#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {64#false} is VALID [2018-11-23 12:56:40,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {64#false} assume !(~i~0 < ~len~0); {64#false} is VALID [2018-11-23 12:56:40,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {64#false} ~i~0 := 0; {64#false} is VALID [2018-11-23 12:56:40,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {64#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {64#false} is VALID [2018-11-23 12:56:40,928 INFO L256 TraceCheckUtils]: 23: Hoare triple {64#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {63#true} is VALID [2018-11-23 12:56:40,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {63#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {63#true} is VALID [2018-11-23 12:56:40,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {63#true} assume !(~index > 0); {63#true} is VALID [2018-11-23 12:56:40,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {63#true} call #t~mem10 := read~int(~head.base, 8 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {63#true} is VALID [2018-11-23 12:56:40,931 INFO L273 TraceCheckUtils]: 27: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-23 12:56:40,931 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {63#true} {64#false} #145#return; {64#false} is VALID [2018-11-23 12:56:40,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {64#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {64#false} is VALID [2018-11-23 12:56:40,932 INFO L273 TraceCheckUtils]: 30: Hoare triple {64#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {64#false} is VALID [2018-11-23 12:56:40,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {64#false} assume !false; {64#false} is VALID [2018-11-23 12:56:40,942 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:56:40,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:40,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:56:40,950 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:56:40,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:40,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:56:41,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:41,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:56:41,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:56:41,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:56:41,140 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-23 12:56:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:41,547 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2018-11-23 12:56:41,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:56:41,547 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:56:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:56:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 127 transitions. [2018-11-23 12:56:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:56:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 127 transitions. [2018-11-23 12:56:41,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 127 transitions. [2018-11-23 12:56:42,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:42,231 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:56:42,231 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:56:42,235 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:56:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:56:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 12:56:42,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:42,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-23 12:56:42,303 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 12:56:42,303 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 12:56:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:42,310 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 12:56:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 12:56:42,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:42,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:42,312 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 12:56:42,312 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 12:56:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:42,318 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 12:56:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 12:56:42,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:42,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:42,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:42,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:56:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-23 12:56:42,326 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2018-11-23 12:56:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:42,327 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-23 12:56:42,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:56:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 12:56:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:56:42,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:42,329 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:42,330 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:42,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:42,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2083918040, now seen corresponding path program 1 times [2018-11-23 12:56:42,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:42,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:42,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:42,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-23 12:56:42,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {355#true} is VALID [2018-11-23 12:56:42,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 12:56:42,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #153#return; {355#true} is VALID [2018-11-23 12:56:42,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret17 := main(); {355#true} is VALID [2018-11-23 12:56:42,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} ~len~0 := 2;~data~0 := 1; {357#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:42,716 INFO L256 TraceCheckUtils]: 6: Hoare triple {357#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {355#true} is VALID [2018-11-23 12:56:42,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {355#true} ~len := #in~len;~data := #in~data; {358#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 12:56:42,717 INFO L256 TraceCheckUtils]: 8: Hoare triple {358#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {355#true} is VALID [2018-11-23 12:56:42,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {355#true} is VALID [2018-11-23 12:56:42,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {355#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {355#true} is VALID [2018-11-23 12:56:42,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {355#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {355#true} is VALID [2018-11-23 12:56:42,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 12:56:42,719 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {355#true} {358#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} #149#return; {358#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 12:56:42,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {358#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 12:56:42,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {358#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !(~len > 1); {359#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-23 12:56:42,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {359#(<= |dll_circular_create_#in~len| 1)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {359#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-23 12:56:42,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {359#(<= |dll_circular_create_#in~len| 1)} assume true; {359#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-23 12:56:42,728 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {359#(<= |dll_circular_create_#in~len| 1)} {357#(<= 2 main_~len~0)} #141#return; {356#false} is VALID [2018-11-23 12:56:42,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {356#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {356#false} is VALID [2018-11-23 12:56:42,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {356#false} assume !(~i~0 < ~len~0); {356#false} is VALID [2018-11-23 12:56:42,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {356#false} ~i~0 := 0; {356#false} is VALID [2018-11-23 12:56:42,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {356#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {356#false} is VALID [2018-11-23 12:56:42,729 INFO L256 TraceCheckUtils]: 23: Hoare triple {356#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {355#true} is VALID [2018-11-23 12:56:42,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {355#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {355#true} is VALID [2018-11-23 12:56:42,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {355#true} assume !(~index > 0); {355#true} is VALID [2018-11-23 12:56:42,730 INFO L273 TraceCheckUtils]: 26: Hoare triple {355#true} call #t~mem10 := read~int(~head.base, 8 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {355#true} is VALID [2018-11-23 12:56:42,730 INFO L273 TraceCheckUtils]: 27: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 12:56:42,730 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {355#true} {356#false} #145#return; {356#false} is VALID [2018-11-23 12:56:42,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {356#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {356#false} is VALID [2018-11-23 12:56:42,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {356#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {356#false} is VALID [2018-11-23 12:56:42,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-23 12:56:42,734 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:56:42,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:42,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:56:42,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:56:42,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:42,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:56:42,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:42,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:56:42,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:56:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:42,870 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2018-11-23 12:56:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:43,300 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-11-23 12:56:43,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:56:43,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 12:56:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2018-11-23 12:56:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2018-11-23 12:56:43,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2018-11-23 12:56:43,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:43,485 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:56:43,486 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:56:43,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:56:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:56:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-23 12:56:43,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:43,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 46 states. [2018-11-23 12:56:43,523 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 46 states. [2018-11-23 12:56:43,523 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 46 states. [2018-11-23 12:56:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:43,528 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 12:56:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 12:56:43,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:43,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:43,529 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 50 states. [2018-11-23 12:56:43,530 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 50 states. [2018-11-23 12:56:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:43,534 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 12:56:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 12:56:43,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:43,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:43,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:43,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:56:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 12:56:43,540 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2018-11-23 12:56:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:43,540 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 12:56:43,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 12:56:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:56:43,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:43,542 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:43,543 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:43,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1251006308, now seen corresponding path program 1 times [2018-11-23 12:56:43,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:43,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:43,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:43,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:43,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:43,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {635#true} call ULTIMATE.init(); {635#true} is VALID [2018-11-23 12:56:43,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {635#true} is VALID [2018-11-23 12:56:43,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {635#true} assume true; {635#true} is VALID [2018-11-23 12:56:43,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {635#true} {635#true} #153#return; {635#true} is VALID [2018-11-23 12:56:43,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {635#true} call #t~ret17 := main(); {635#true} is VALID [2018-11-23 12:56:43,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {635#true} ~len~0 := 2;~data~0 := 1; {637#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:43,715 INFO L256 TraceCheckUtils]: 6: Hoare triple {637#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {635#true} is VALID [2018-11-23 12:56:43,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {635#true} ~len := #in~len;~data := #in~data; {635#true} is VALID [2018-11-23 12:56:43,716 INFO L256 TraceCheckUtils]: 8: Hoare triple {635#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {635#true} is VALID [2018-11-23 12:56:43,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {635#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {635#true} is VALID [2018-11-23 12:56:43,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {635#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {635#true} is VALID [2018-11-23 12:56:43,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {635#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {635#true} is VALID [2018-11-23 12:56:43,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {635#true} assume true; {635#true} is VALID [2018-11-23 12:56:43,718 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {635#true} {635#true} #149#return; {635#true} is VALID [2018-11-23 12:56:43,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {635#true} is VALID [2018-11-23 12:56:43,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {635#true} assume !!(~len > 1); {635#true} is VALID [2018-11-23 12:56:43,719 INFO L256 TraceCheckUtils]: 16: Hoare triple {635#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {635#true} is VALID [2018-11-23 12:56:43,719 INFO L273 TraceCheckUtils]: 17: Hoare triple {635#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {635#true} is VALID [2018-11-23 12:56:43,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {635#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {635#true} is VALID [2018-11-23 12:56:43,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {635#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {635#true} is VALID [2018-11-23 12:56:43,720 INFO L273 TraceCheckUtils]: 20: Hoare triple {635#true} assume true; {635#true} is VALID [2018-11-23 12:56:43,720 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {635#true} {635#true} #151#return; {635#true} is VALID [2018-11-23 12:56:43,721 INFO L273 TraceCheckUtils]: 22: Hoare triple {635#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {635#true} is VALID [2018-11-23 12:56:43,721 INFO L273 TraceCheckUtils]: 23: Hoare triple {635#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {635#true} is VALID [2018-11-23 12:56:43,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {635#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {635#true} is VALID [2018-11-23 12:56:43,722 INFO L273 TraceCheckUtils]: 25: Hoare triple {635#true} assume !(~len > 1); {635#true} is VALID [2018-11-23 12:56:43,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {635#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {635#true} is VALID [2018-11-23 12:56:43,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {635#true} assume true; {635#true} is VALID [2018-11-23 12:56:43,725 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {635#true} {637#(<= 2 main_~len~0)} #141#return; {637#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:43,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {637#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {638#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:56:43,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {638#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !(~i~0 < ~len~0); {636#false} is VALID [2018-11-23 12:56:43,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {636#false} ~i~0 := 0; {636#false} is VALID [2018-11-23 12:56:43,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {636#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {636#false} is VALID [2018-11-23 12:56:43,728 INFO L256 TraceCheckUtils]: 33: Hoare triple {636#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {635#true} is VALID [2018-11-23 12:56:43,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {635#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {635#true} is VALID [2018-11-23 12:56:43,729 INFO L273 TraceCheckUtils]: 35: Hoare triple {635#true} assume !(~index > 0); {635#true} is VALID [2018-11-23 12:56:43,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {635#true} call #t~mem10 := read~int(~head.base, 8 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {635#true} is VALID [2018-11-23 12:56:43,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {635#true} assume true; {635#true} is VALID [2018-11-23 12:56:43,730 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {635#true} {636#false} #145#return; {636#false} is VALID [2018-11-23 12:56:43,730 INFO L273 TraceCheckUtils]: 39: Hoare triple {636#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {636#false} is VALID [2018-11-23 12:56:43,731 INFO L273 TraceCheckUtils]: 40: Hoare triple {636#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {636#false} is VALID [2018-11-23 12:56:43,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {636#false} assume !false; {636#false} is VALID [2018-11-23 12:56:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:56:43,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:43,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:56:43,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 12:56:43,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:43,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:56:43,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:43,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:56:43,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:56:43,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:56:43,822 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-11-23 12:56:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:44,170 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-23 12:56:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:56:44,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 12:56:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:56:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 12:56:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:56:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 12:56:44,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-23 12:56:44,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:44,348 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:56:44,348 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:56:44,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:56:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:56:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-11-23 12:56:44,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:44,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 47 states. [2018-11-23 12:56:44,400 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 47 states. [2018-11-23 12:56:44,401 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 47 states. [2018-11-23 12:56:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:44,405 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 12:56:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 12:56:44,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:44,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:44,406 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 56 states. [2018-11-23 12:56:44,407 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 56 states. [2018-11-23 12:56:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:44,411 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 12:56:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 12:56:44,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:44,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:44,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:44,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:56:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 12:56:44,416 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-11-23 12:56:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:44,416 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 12:56:44,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:56:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 12:56:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:56:44,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:44,419 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:44,419 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:44,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:44,419 INFO L82 PathProgramCache]: Analyzing trace with hash 811064934, now seen corresponding path program 1 times [2018-11-23 12:56:44,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:44,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:44,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:44,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:44,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:44,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2018-11-23 12:56:44,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {920#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {920#true} is VALID [2018-11-23 12:56:44,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:44,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #153#return; {920#true} is VALID [2018-11-23 12:56:44,646 INFO L256 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret17 := main(); {920#true} is VALID [2018-11-23 12:56:44,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {920#true} ~len~0 := 2;~data~0 := 1; {922#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:44,647 INFO L256 TraceCheckUtils]: 6: Hoare triple {922#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {920#true} is VALID [2018-11-23 12:56:44,647 INFO L273 TraceCheckUtils]: 7: Hoare triple {920#true} ~len := #in~len;~data := #in~data; {920#true} is VALID [2018-11-23 12:56:44,648 INFO L256 TraceCheckUtils]: 8: Hoare triple {920#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {920#true} is VALID [2018-11-23 12:56:44,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {920#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {920#true} is VALID [2018-11-23 12:56:44,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {920#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {920#true} is VALID [2018-11-23 12:56:44,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {920#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {920#true} is VALID [2018-11-23 12:56:44,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:44,649 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {920#true} {920#true} #149#return; {920#true} is VALID [2018-11-23 12:56:44,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {920#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {920#true} is VALID [2018-11-23 12:56:44,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#true} assume !!(~len > 1); {920#true} is VALID [2018-11-23 12:56:44,650 INFO L256 TraceCheckUtils]: 16: Hoare triple {920#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {920#true} is VALID [2018-11-23 12:56:44,650 INFO L273 TraceCheckUtils]: 17: Hoare triple {920#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {920#true} is VALID [2018-11-23 12:56:44,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {920#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {920#true} is VALID [2018-11-23 12:56:44,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {920#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {920#true} is VALID [2018-11-23 12:56:44,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:44,651 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {920#true} {920#true} #151#return; {920#true} is VALID [2018-11-23 12:56:44,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {920#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {920#true} is VALID [2018-11-23 12:56:44,652 INFO L273 TraceCheckUtils]: 23: Hoare triple {920#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {920#true} is VALID [2018-11-23 12:56:44,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {920#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {920#true} is VALID [2018-11-23 12:56:44,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {920#true} assume !(~len > 1); {920#true} is VALID [2018-11-23 12:56:44,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {920#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {920#true} is VALID [2018-11-23 12:56:44,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:44,666 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {920#true} {922#(<= 2 main_~len~0)} #141#return; {922#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:44,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {922#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {923#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:56:44,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {923#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {923#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:56:44,668 INFO L256 TraceCheckUtils]: 31: Hoare triple {923#(and (<= 2 main_~len~0) (= main_~i~0 0))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {920#true} is VALID [2018-11-23 12:56:44,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {920#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {920#true} is VALID [2018-11-23 12:56:44,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {920#true} assume !(~index > 0); {920#true} is VALID [2018-11-23 12:56:44,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {920#true} call write~int(~data, ~head.base, 8 + ~head.offset, 4); {920#true} is VALID [2018-11-23 12:56:44,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:44,670 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {920#true} {923#(and (<= 2 main_~len~0) (= main_~i~0 0))} #143#return; {923#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 12:56:44,679 INFO L273 TraceCheckUtils]: 37: Hoare triple {923#(and (<= 2 main_~len~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {924#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-23 12:56:44,680 INFO L273 TraceCheckUtils]: 38: Hoare triple {924#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {921#false} is VALID [2018-11-23 12:56:44,680 INFO L273 TraceCheckUtils]: 39: Hoare triple {921#false} ~i~0 := 0; {921#false} is VALID [2018-11-23 12:56:44,680 INFO L273 TraceCheckUtils]: 40: Hoare triple {921#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {921#false} is VALID [2018-11-23 12:56:44,680 INFO L256 TraceCheckUtils]: 41: Hoare triple {921#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {920#true} is VALID [2018-11-23 12:56:44,680 INFO L273 TraceCheckUtils]: 42: Hoare triple {920#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {920#true} is VALID [2018-11-23 12:56:44,681 INFO L273 TraceCheckUtils]: 43: Hoare triple {920#true} assume !(~index > 0); {920#true} is VALID [2018-11-23 12:56:44,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {920#true} call #t~mem10 := read~int(~head.base, 8 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {920#true} is VALID [2018-11-23 12:56:44,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:44,681 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {920#true} {921#false} #145#return; {921#false} is VALID [2018-11-23 12:56:44,681 INFO L273 TraceCheckUtils]: 47: Hoare triple {921#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {921#false} is VALID [2018-11-23 12:56:44,682 INFO L273 TraceCheckUtils]: 48: Hoare triple {921#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {921#false} is VALID [2018-11-23 12:56:44,682 INFO L273 TraceCheckUtils]: 49: Hoare triple {921#false} assume !false; {921#false} is VALID [2018-11-23 12:56:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:56:44,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:44,687 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:56:44,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:44,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:45,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2018-11-23 12:56:45,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {920#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {920#true} is VALID [2018-11-23 12:56:45,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:45,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #153#return; {920#true} is VALID [2018-11-23 12:56:45,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret17 := main(); {920#true} is VALID [2018-11-23 12:56:45,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {920#true} ~len~0 := 2;~data~0 := 1; {922#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:45,264 INFO L256 TraceCheckUtils]: 6: Hoare triple {922#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {920#true} is VALID [2018-11-23 12:56:45,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {920#true} ~len := #in~len;~data := #in~data; {920#true} is VALID [2018-11-23 12:56:45,264 INFO L256 TraceCheckUtils]: 8: Hoare triple {920#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {920#true} is VALID [2018-11-23 12:56:45,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {920#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {920#true} is VALID [2018-11-23 12:56:45,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {920#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {920#true} is VALID [2018-11-23 12:56:45,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {920#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {920#true} is VALID [2018-11-23 12:56:45,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:45,265 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {920#true} {920#true} #149#return; {920#true} is VALID [2018-11-23 12:56:45,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {920#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {920#true} is VALID [2018-11-23 12:56:45,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#true} assume !!(~len > 1); {920#true} is VALID [2018-11-23 12:56:45,266 INFO L256 TraceCheckUtils]: 16: Hoare triple {920#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {920#true} is VALID [2018-11-23 12:56:45,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {920#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {920#true} is VALID [2018-11-23 12:56:45,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {920#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {920#true} is VALID [2018-11-23 12:56:45,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {920#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {920#true} is VALID [2018-11-23 12:56:45,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:45,267 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {920#true} {920#true} #151#return; {920#true} is VALID [2018-11-23 12:56:45,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {920#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {920#true} is VALID [2018-11-23 12:56:45,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {920#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {920#true} is VALID [2018-11-23 12:56:45,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {920#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {920#true} is VALID [2018-11-23 12:56:45,267 INFO L273 TraceCheckUtils]: 25: Hoare triple {920#true} assume !(~len > 1); {920#true} is VALID [2018-11-23 12:56:45,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {920#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {920#true} is VALID [2018-11-23 12:56:45,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:45,274 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {920#true} {922#(<= 2 main_~len~0)} #141#return; {922#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:45,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {922#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {1015#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:56:45,279 INFO L273 TraceCheckUtils]: 30: Hoare triple {1015#(and (<= main_~i~0 0) (<= 2 main_~len~0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1015#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:56:45,279 INFO L256 TraceCheckUtils]: 31: Hoare triple {1015#(and (<= main_~i~0 0) (<= 2 main_~len~0))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {920#true} is VALID [2018-11-23 12:56:45,280 INFO L273 TraceCheckUtils]: 32: Hoare triple {920#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {920#true} is VALID [2018-11-23 12:56:45,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {920#true} assume !(~index > 0); {920#true} is VALID [2018-11-23 12:56:45,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {920#true} call write~int(~data, ~head.base, 8 + ~head.offset, 4); {920#true} is VALID [2018-11-23 12:56:45,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {920#true} assume true; {920#true} is VALID [2018-11-23 12:56:45,284 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {920#true} {1015#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #143#return; {1015#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 12:56:45,285 INFO L273 TraceCheckUtils]: 37: Hoare triple {1015#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1040#(and (<= main_~i~0 1) (<= 2 main_~len~0))} is VALID [2018-11-23 12:56:45,286 INFO L273 TraceCheckUtils]: 38: Hoare triple {1040#(and (<= main_~i~0 1) (<= 2 main_~len~0))} assume !(~i~0 < ~len~0); {921#false} is VALID [2018-11-23 12:56:45,286 INFO L273 TraceCheckUtils]: 39: Hoare triple {921#false} ~i~0 := 0; {921#false} is VALID [2018-11-23 12:56:45,286 INFO L273 TraceCheckUtils]: 40: Hoare triple {921#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {921#false} is VALID [2018-11-23 12:56:45,287 INFO L256 TraceCheckUtils]: 41: Hoare triple {921#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {921#false} is VALID [2018-11-23 12:56:45,287 INFO L273 TraceCheckUtils]: 42: Hoare triple {921#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {921#false} is VALID [2018-11-23 12:56:45,288 INFO L273 TraceCheckUtils]: 43: Hoare triple {921#false} assume !(~index > 0); {921#false} is VALID [2018-11-23 12:56:45,288 INFO L273 TraceCheckUtils]: 44: Hoare triple {921#false} call #t~mem10 := read~int(~head.base, 8 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {921#false} is VALID [2018-11-23 12:56:45,288 INFO L273 TraceCheckUtils]: 45: Hoare triple {921#false} assume true; {921#false} is VALID [2018-11-23 12:56:45,289 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {921#false} {921#false} #145#return; {921#false} is VALID [2018-11-23 12:56:45,289 INFO L273 TraceCheckUtils]: 47: Hoare triple {921#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {921#false} is VALID [2018-11-23 12:56:45,289 INFO L273 TraceCheckUtils]: 48: Hoare triple {921#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {921#false} is VALID [2018-11-23 12:56:45,290 INFO L273 TraceCheckUtils]: 49: Hoare triple {921#false} assume !false; {921#false} is VALID [2018-11-23 12:56:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:56:45,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:45,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 12:56:45,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-23 12:56:45,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:45,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:56:45,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:45,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:56:45,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:56:45,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:56:45,443 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2018-11-23 12:56:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:46,045 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-23 12:56:46,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:56:46,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-23 12:56:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:56:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-23 12:56:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:56:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-23 12:56:46,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2018-11-23 12:56:46,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:46,195 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:56:46,196 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:56:46,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:56:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:56:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-11-23 12:56:46,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:46,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 50 states. [2018-11-23 12:56:46,248 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 50 states. [2018-11-23 12:56:46,248 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 50 states. [2018-11-23 12:56:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:46,253 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 12:56:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-11-23 12:56:46,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:46,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:46,255 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 66 states. [2018-11-23 12:56:46,255 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 66 states. [2018-11-23 12:56:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:46,260 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 12:56:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-11-23 12:56:46,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:46,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:46,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:46,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:56:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 12:56:46,265 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 50 [2018-11-23 12:56:46,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:46,265 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 12:56:46,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:56:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 12:56:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:56:46,267 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:46,267 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:46,267 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:46,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:46,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1548015056, now seen corresponding path program 2 times [2018-11-23 12:56:46,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:46,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:46,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:46,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:46,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:46,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {1397#true} call ULTIMATE.init(); {1397#true} is VALID [2018-11-23 12:56:46,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {1397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1397#true} is VALID [2018-11-23 12:56:46,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1397#true} #153#return; {1397#true} is VALID [2018-11-23 12:56:46,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {1397#true} call #t~ret17 := main(); {1397#true} is VALID [2018-11-23 12:56:46,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {1397#true} ~len~0 := 2;~data~0 := 1; {1399#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:46,460 INFO L256 TraceCheckUtils]: 6: Hoare triple {1399#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1397#true} is VALID [2018-11-23 12:56:46,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {1397#true} ~len := #in~len;~data := #in~data; {1397#true} is VALID [2018-11-23 12:56:46,460 INFO L256 TraceCheckUtils]: 8: Hoare triple {1397#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1397#true} is VALID [2018-11-23 12:56:46,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {1397#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1397#true} is VALID [2018-11-23 12:56:46,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {1397#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1397#true} is VALID [2018-11-23 12:56:46,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {1397#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1397#true} is VALID [2018-11-23 12:56:46,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,461 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1397#true} {1397#true} #149#return; {1397#true} is VALID [2018-11-23 12:56:46,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {1397#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1397#true} is VALID [2018-11-23 12:56:46,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {1397#true} assume !!(~len > 1); {1397#true} is VALID [2018-11-23 12:56:46,462 INFO L256 TraceCheckUtils]: 16: Hoare triple {1397#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1397#true} is VALID [2018-11-23 12:56:46,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {1397#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1397#true} is VALID [2018-11-23 12:56:46,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {1397#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1397#true} is VALID [2018-11-23 12:56:46,463 INFO L273 TraceCheckUtils]: 19: Hoare triple {1397#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1397#true} is VALID [2018-11-23 12:56:46,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,464 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1397#true} {1397#true} #151#return; {1397#true} is VALID [2018-11-23 12:56:46,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {1397#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {1397#true} is VALID [2018-11-23 12:56:46,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {1397#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {1397#true} is VALID [2018-11-23 12:56:46,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {1397#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1397#true} is VALID [2018-11-23 12:56:46,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {1397#true} assume !(~len > 1); {1397#true} is VALID [2018-11-23 12:56:46,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {1397#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1397#true} is VALID [2018-11-23 12:56:46,465 INFO L273 TraceCheckUtils]: 27: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,475 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1397#true} {1399#(<= 2 main_~len~0)} #141#return; {1399#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:46,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {1399#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {1399#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:46,476 INFO L273 TraceCheckUtils]: 30: Hoare triple {1399#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1399#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:46,477 INFO L256 TraceCheckUtils]: 31: Hoare triple {1399#(<= 2 main_~len~0)} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1397#true} is VALID [2018-11-23 12:56:46,477 INFO L273 TraceCheckUtils]: 32: Hoare triple {1397#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1397#true} is VALID [2018-11-23 12:56:46,477 INFO L273 TraceCheckUtils]: 33: Hoare triple {1397#true} assume !(~index > 0); {1397#true} is VALID [2018-11-23 12:56:46,478 INFO L273 TraceCheckUtils]: 34: Hoare triple {1397#true} call write~int(~data, ~head.base, 8 + ~head.offset, 4); {1397#true} is VALID [2018-11-23 12:56:46,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,480 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1397#true} {1399#(<= 2 main_~len~0)} #143#return; {1399#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:46,482 INFO L273 TraceCheckUtils]: 37: Hoare triple {1399#(<= 2 main_~len~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1399#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:46,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {1399#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1399#(<= 2 main_~len~0)} is VALID [2018-11-23 12:56:46,482 INFO L256 TraceCheckUtils]: 39: Hoare triple {1399#(<= 2 main_~len~0)} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1397#true} is VALID [2018-11-23 12:56:46,485 INFO L273 TraceCheckUtils]: 40: Hoare triple {1397#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1400#(<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)} is VALID [2018-11-23 12:56:46,485 INFO L273 TraceCheckUtils]: 41: Hoare triple {1400#(<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)} assume !(~index > 0); {1401#(<= |dll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:56:46,487 INFO L273 TraceCheckUtils]: 42: Hoare triple {1401#(<= |dll_circular_update_at_#in~index| 0)} call write~int(~data, ~head.base, 8 + ~head.offset, 4); {1401#(<= |dll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:56:46,490 INFO L273 TraceCheckUtils]: 43: Hoare triple {1401#(<= |dll_circular_update_at_#in~index| 0)} assume true; {1401#(<= |dll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:56:46,491 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1401#(<= |dll_circular_update_at_#in~index| 0)} {1399#(<= 2 main_~len~0)} #143#return; {1402#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2018-11-23 12:56:46,492 INFO L273 TraceCheckUtils]: 45: Hoare triple {1402#(<= (+ main_~i~0 2) main_~len~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1403#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-23 12:56:46,493 INFO L273 TraceCheckUtils]: 46: Hoare triple {1403#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {1398#false} is VALID [2018-11-23 12:56:46,493 INFO L273 TraceCheckUtils]: 47: Hoare triple {1398#false} ~i~0 := 0; {1398#false} is VALID [2018-11-23 12:56:46,493 INFO L273 TraceCheckUtils]: 48: Hoare triple {1398#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1398#false} is VALID [2018-11-23 12:56:46,494 INFO L256 TraceCheckUtils]: 49: Hoare triple {1398#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1397#true} is VALID [2018-11-23 12:56:46,494 INFO L273 TraceCheckUtils]: 50: Hoare triple {1397#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1397#true} is VALID [2018-11-23 12:56:46,494 INFO L273 TraceCheckUtils]: 51: Hoare triple {1397#true} assume !(~index > 0); {1397#true} is VALID [2018-11-23 12:56:46,495 INFO L273 TraceCheckUtils]: 52: Hoare triple {1397#true} call #t~mem10 := read~int(~head.base, 8 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {1397#true} is VALID [2018-11-23 12:56:46,495 INFO L273 TraceCheckUtils]: 53: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,495 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1397#true} {1398#false} #145#return; {1398#false} is VALID [2018-11-23 12:56:46,495 INFO L273 TraceCheckUtils]: 55: Hoare triple {1398#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1398#false} is VALID [2018-11-23 12:56:46,496 INFO L273 TraceCheckUtils]: 56: Hoare triple {1398#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1398#false} is VALID [2018-11-23 12:56:46,496 INFO L273 TraceCheckUtils]: 57: Hoare triple {1398#false} assume !false; {1398#false} is VALID [2018-11-23 12:56:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:56:46,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:46,501 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:56:46,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:56:46,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:56:46,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:56:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:46,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:46,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {1397#true} call ULTIMATE.init(); {1397#true} is VALID [2018-11-23 12:56:46,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {1397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1397#true} is VALID [2018-11-23 12:56:46,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1397#true} #153#return; {1397#true} is VALID [2018-11-23 12:56:46,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {1397#true} call #t~ret17 := main(); {1397#true} is VALID [2018-11-23 12:56:46,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {1397#true} ~len~0 := 2;~data~0 := 1; {1397#true} is VALID [2018-11-23 12:56:46,835 INFO L256 TraceCheckUtils]: 6: Hoare triple {1397#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1397#true} is VALID [2018-11-23 12:56:46,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {1397#true} ~len := #in~len;~data := #in~data; {1397#true} is VALID [2018-11-23 12:56:46,835 INFO L256 TraceCheckUtils]: 8: Hoare triple {1397#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1397#true} is VALID [2018-11-23 12:56:46,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {1397#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1397#true} is VALID [2018-11-23 12:56:46,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {1397#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1397#true} is VALID [2018-11-23 12:56:46,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {1397#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1397#true} is VALID [2018-11-23 12:56:46,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,836 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1397#true} {1397#true} #149#return; {1397#true} is VALID [2018-11-23 12:56:46,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {1397#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1397#true} is VALID [2018-11-23 12:56:46,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {1397#true} assume !!(~len > 1); {1397#true} is VALID [2018-11-23 12:56:46,837 INFO L256 TraceCheckUtils]: 16: Hoare triple {1397#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1397#true} is VALID [2018-11-23 12:56:46,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {1397#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1397#true} is VALID [2018-11-23 12:56:46,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {1397#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1397#true} is VALID [2018-11-23 12:56:46,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {1397#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, 8 + ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1397#true} is VALID [2018-11-23 12:56:46,838 INFO L273 TraceCheckUtils]: 20: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,838 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1397#true} {1397#true} #151#return; {1397#true} is VALID [2018-11-23 12:56:46,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {1397#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); {1397#true} is VALID [2018-11-23 12:56:46,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {1397#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); {1397#true} is VALID [2018-11-23 12:56:46,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {1397#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1397#true} is VALID [2018-11-23 12:56:46,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {1397#true} assume !(~len > 1); {1397#true} is VALID [2018-11-23 12:56:46,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {1397#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1397#true} is VALID [2018-11-23 12:56:46,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,840 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1397#true} {1397#true} #141#return; {1397#true} is VALID [2018-11-23 12:56:46,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {1397#true} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := 0; {1494#(<= 0 main_~i~0)} is VALID [2018-11-23 12:56:46,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {1494#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1494#(<= 0 main_~i~0)} is VALID [2018-11-23 12:56:46,862 INFO L256 TraceCheckUtils]: 31: Hoare triple {1494#(<= 0 main_~i~0)} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1397#true} is VALID [2018-11-23 12:56:46,862 INFO L273 TraceCheckUtils]: 32: Hoare triple {1397#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1397#true} is VALID [2018-11-23 12:56:46,863 INFO L273 TraceCheckUtils]: 33: Hoare triple {1397#true} assume !(~index > 0); {1397#true} is VALID [2018-11-23 12:56:46,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {1397#true} call write~int(~data, ~head.base, 8 + ~head.offset, 4); {1397#true} is VALID [2018-11-23 12:56:46,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {1397#true} assume true; {1397#true} is VALID [2018-11-23 12:56:46,864 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1397#true} {1494#(<= 0 main_~i~0)} #143#return; {1494#(<= 0 main_~i~0)} is VALID [2018-11-23 12:56:46,868 INFO L273 TraceCheckUtils]: 37: Hoare triple {1494#(<= 0 main_~i~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1519#(<= 1 main_~i~0)} is VALID [2018-11-23 12:56:46,868 INFO L273 TraceCheckUtils]: 38: Hoare triple {1519#(<= 1 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1519#(<= 1 main_~i~0)} is VALID [2018-11-23 12:56:46,869 INFO L256 TraceCheckUtils]: 39: Hoare triple {1519#(<= 1 main_~i~0)} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1397#true} is VALID [2018-11-23 12:56:46,869 INFO L273 TraceCheckUtils]: 40: Hoare triple {1397#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1400#(<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)} is VALID [2018-11-23 12:56:46,870 INFO L273 TraceCheckUtils]: 41: Hoare triple {1400#(<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)} assume !(~index > 0); {1401#(<= |dll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:56:46,871 INFO L273 TraceCheckUtils]: 42: Hoare triple {1401#(<= |dll_circular_update_at_#in~index| 0)} call write~int(~data, ~head.base, 8 + ~head.offset, 4); {1401#(<= |dll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:56:46,872 INFO L273 TraceCheckUtils]: 43: Hoare triple {1401#(<= |dll_circular_update_at_#in~index| 0)} assume true; {1401#(<= |dll_circular_update_at_#in~index| 0)} is VALID [2018-11-23 12:56:46,874 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1401#(<= |dll_circular_update_at_#in~index| 0)} {1519#(<= 1 main_~i~0)} #143#return; {1398#false} is VALID [2018-11-23 12:56:46,874 INFO L273 TraceCheckUtils]: 45: Hoare triple {1398#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1398#false} is VALID [2018-11-23 12:56:46,875 INFO L273 TraceCheckUtils]: 46: Hoare triple {1398#false} assume !(~i~0 < ~len~0); {1398#false} is VALID [2018-11-23 12:56:46,875 INFO L273 TraceCheckUtils]: 47: Hoare triple {1398#false} ~i~0 := 0; {1398#false} is VALID [2018-11-23 12:56:46,875 INFO L273 TraceCheckUtils]: 48: Hoare triple {1398#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1398#false} is VALID [2018-11-23 12:56:46,876 INFO L256 TraceCheckUtils]: 49: Hoare triple {1398#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1398#false} is VALID [2018-11-23 12:56:46,876 INFO L273 TraceCheckUtils]: 50: Hoare triple {1398#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1398#false} is VALID [2018-11-23 12:56:46,876 INFO L273 TraceCheckUtils]: 51: Hoare triple {1398#false} assume !(~index > 0); {1398#false} is VALID [2018-11-23 12:56:46,877 INFO L273 TraceCheckUtils]: 52: Hoare triple {1398#false} call #t~mem10 := read~int(~head.base, 8 + ~head.offset, 4);#res := #t~mem10;havoc #t~mem10; {1398#false} is VALID [2018-11-23 12:56:46,877 INFO L273 TraceCheckUtils]: 53: Hoare triple {1398#false} assume true; {1398#false} is VALID [2018-11-23 12:56:46,877 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1398#false} {1398#false} #145#return; {1398#false} is VALID [2018-11-23 12:56:46,877 INFO L273 TraceCheckUtils]: 55: Hoare triple {1398#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1398#false} is VALID [2018-11-23 12:56:46,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {1398#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1398#false} is VALID [2018-11-23 12:56:46,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {1398#false} assume !false; {1398#false} is VALID [2018-11-23 12:56:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:56:46,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:56:46,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 12:56:46,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-23 12:56:46,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:46,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:56:47,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:47,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:56:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:56:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:56:47,032 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 9 states. [2018-11-23 12:56:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:48,064 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-11-23 12:56:48,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:56:48,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-23 12:56:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:56:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2018-11-23 12:56:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:56:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2018-11-23 12:56:48,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2018-11-23 12:56:48,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:48,283 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:56:48,283 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:56:48,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:56:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:56:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-11-23 12:56:48,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:48,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 54 states. [2018-11-23 12:56:48,554 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 54 states. [2018-11-23 12:56:48,554 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 54 states. [2018-11-23 12:56:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:48,558 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-23 12:56:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-23 12:56:48,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:48,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:48,559 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 62 states. [2018-11-23 12:56:48,559 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 62 states. [2018-11-23 12:56:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:48,562 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-23 12:56:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-23 12:56:48,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:48,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:48,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:48,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:56:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-23 12:56:48,566 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 58 [2018-11-23 12:56:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:48,567 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-23 12:56:48,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:56:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 12:56:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:56:48,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:48,568 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:48,568 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:48,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:48,569 INFO L82 PathProgramCache]: Analyzing trace with hash -275154794, now seen corresponding path program 1 times [2018-11-23 12:56:48,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:48,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:48,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:48,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:50,308 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:56:50,312 INFO L168 Benchmark]: Toolchain (without parser) took 11846.81 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -745.4 MB). Peak memory consumption was 108.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:50,315 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:50,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.28 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:50,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.30 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:50,317 INFO L168 Benchmark]: Boogie Preprocessor took 63.69 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:50,317 INFO L168 Benchmark]: RCFGBuilder took 1178.88 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:50,318 INFO L168 Benchmark]: TraceAbstraction took 9764.72 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 148.9 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -43.0 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:50,322 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.28 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 109.30 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.69 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1178.88 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9764.72 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 148.9 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -43.0 MB). Peak memory consumption was 105.9 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...