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/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:22,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:22,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:22,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:22,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:22,410 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:22,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:22,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:22,414 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:22,415 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:22,416 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:22,416 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:22,417 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:22,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:22,420 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:22,420 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:22,421 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:22,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:22,425 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:22,427 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:22,428 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:22,429 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:22,432 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:22,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:22,432 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:22,433 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:22,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:22,435 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:22,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:22,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:22,437 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:22,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:22,438 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:22,439 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:22,440 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:22,441 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:22,441 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 13:00:22,457 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:22,457 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:22,458 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:22,458 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:22,459 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:22,459 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:22,459 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:22,459 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:22,459 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:22,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:22,460 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:22,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:22,460 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:22,460 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:22,461 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:22,461 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:22,461 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:22,461 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:22,461 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:22,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:22,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:22,462 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:22,462 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:22,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:22,463 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:22,463 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:22,463 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:22,463 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:22,463 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:22,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:22,464 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:22,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:22,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:22,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:22,542 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:22,542 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:22,543 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 13:00:22,614 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db8d8fb3/e29d9b4eb8b345e7a6cb3f28dcb9e947/FLAG2b2e157db [2018-11-23 13:00:23,137 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:23,137 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 13:00:23,151 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db8d8fb3/e29d9b4eb8b345e7a6cb3f28dcb9e947/FLAG2b2e157db [2018-11-23 13:00:23,398 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db8d8fb3/e29d9b4eb8b345e7a6cb3f28dcb9e947 [2018-11-23 13:00:23,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:23,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:23,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:23,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:23,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:23,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:23" (1/1) ... [2018-11-23 13:00:23,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd72e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:23, skipping insertion in model container [2018-11-23 13:00:23,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:23" (1/1) ... [2018-11-23 13:00:23,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:23,489 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:23,884 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:23,901 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:24,014 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:24,081 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:24,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24 WrapperNode [2018-11-23 13:00:24,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:24,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:24,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:24,083 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:24,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (1/1) ... [2018-11-23 13:00:24,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (1/1) ... [2018-11-23 13:00:24,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:24,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:24,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:24,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:24,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (1/1) ... [2018-11-23 13:00:24,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (1/1) ... [2018-11-23 13:00:24,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (1/1) ... [2018-11-23 13:00:24,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (1/1) ... [2018-11-23 13:00:24,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (1/1) ... [2018-11-23 13:00:24,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (1/1) ... [2018-11-23 13:00:24,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (1/1) ... [2018-11-23 13:00:24,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:24,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:24,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:24,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:24,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (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 13:00:24,301 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-23 13:00:24,302 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-23 13:00:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 13:00:24,302 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 13:00:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-23 13:00:24,303 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-23 13:00:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 13:00:24,303 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 13:00:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 13:00:24,303 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 13:00:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:24,304 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 13:00:24,304 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 13:00:24,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:24,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:24,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:24,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:00:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:24,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:25,316 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:25,316 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:00:25,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:25 BoogieIcfgContainer [2018-11-23 13:00:25,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:25,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:25,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:25,323 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:25,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:23" (1/3) ... [2018-11-23 13:00:25,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e5dd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:25, skipping insertion in model container [2018-11-23 13:00:25,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:24" (2/3) ... [2018-11-23 13:00:25,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e5dd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:25, skipping insertion in model container [2018-11-23 13:00:25,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:25" (3/3) ... [2018-11-23 13:00:25,327 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 13:00:25,338 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:25,346 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:00:25,365 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:00:25,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:25,399 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:25,399 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:25,399 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:25,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:25,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:25,400 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:25,400 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:25,400 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-23 13:00:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:00:25,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:25,428 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] [2018-11-23 13:00:25,430 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:25,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:25,436 INFO L82 PathProgramCache]: Analyzing trace with hash -43549588, now seen corresponding path program 1 times [2018-11-23 13:00:25,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:25,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:25,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:25,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2018-11-23 13:00:25,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58#true} is VALID [2018-11-23 13:00:25,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2018-11-23 13:00:25,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #136#return; {58#true} is VALID [2018-11-23 13:00:25,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret15 := main(); {58#true} is VALID [2018-11-23 13:00:25,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {58#true} ~len~0 := 2;~data~0 := 1; {60#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:25,818 INFO L256 TraceCheckUtils]: 6: Hoare triple {60#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {58#true} is VALID [2018-11-23 13:00:25,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {58#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {61#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:25,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {62#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:25,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {62#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {62#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:25,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {62#(<= |sll_create_#in~len| 0)} assume true; {62#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:25,856 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {62#(<= |sll_create_#in~len| 0)} {60#(<= 2 main_~len~0)} #126#return; {59#false} is VALID [2018-11-23 13:00:25,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {59#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {59#false} is VALID [2018-11-23 13:00:25,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {59#false} assume !(~i~0 < ~len~0); {59#false} is VALID [2018-11-23 13:00:25,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {59#false} ~i~0 := 0; {59#false} is VALID [2018-11-23 13:00:25,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {59#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {59#false} is VALID [2018-11-23 13:00:25,859 INFO L256 TraceCheckUtils]: 16: Hoare triple {59#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {58#true} is VALID [2018-11-23 13:00:25,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {58#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {58#true} is VALID [2018-11-23 13:00:25,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {58#true} assume !(~index > 0); {58#true} is VALID [2018-11-23 13:00:25,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {58#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {58#true} is VALID [2018-11-23 13:00:25,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {58#true} assume true; {58#true} is VALID [2018-11-23 13:00:25,860 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {58#true} {59#false} #130#return; {59#false} is VALID [2018-11-23 13:00:25,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {59#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {59#false} is VALID [2018-11-23 13:00:25,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {59#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {59#false} is VALID [2018-11-23 13:00:25,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {59#false} assume !false; {59#false} is VALID [2018-11-23 13:00:25,867 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 13:00:25,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:25,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:00:25,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 13:00:25,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:25,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:00:25,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:25,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:00:25,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:00:25,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:25,991 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-11-23 13:00:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:27,040 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2018-11-23 13:00:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:00:27,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 13:00:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:00:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2018-11-23 13:00:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:00:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2018-11-23 13:00:27,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 126 transitions. [2018-11-23 13:00:27,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:27,379 INFO L225 Difference]: With dead ends: 97 [2018-11-23 13:00:27,379 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:00:27,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:00:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-23 13:00:27,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:27,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 43 states. [2018-11-23 13:00:27,649 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 43 states. [2018-11-23 13:00:27,650 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 43 states. [2018-11-23 13:00:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:27,657 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 13:00:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 13:00:27,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:27,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:27,658 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 46 states. [2018-11-23 13:00:27,659 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 46 states. [2018-11-23 13:00:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:27,664 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 13:00:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 13:00:27,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:27,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:27,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:27,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:00:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 13:00:27,672 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2018-11-23 13:00:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:27,672 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 13:00:27,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:00:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 13:00:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:00:27,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:27,675 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, 1, 1] [2018-11-23 13:00:27,675 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:27,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:27,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1735963221, now seen corresponding path program 1 times [2018-11-23 13:00:27,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:27,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:27,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:27,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 13:00:27,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {356#true} is VALID [2018-11-23 13:00:27,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 13:00:27,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #136#return; {356#true} is VALID [2018-11-23 13:00:27,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret15 := main(); {356#true} is VALID [2018-11-23 13:00:27,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} ~len~0 := 2;~data~0 := 1; {358#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:27,900 INFO L256 TraceCheckUtils]: 6: Hoare triple {358#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {356#true} is VALID [2018-11-23 13:00:27,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {356#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {359#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:27,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {359#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {359#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:27,901 INFO L256 TraceCheckUtils]: 9: Hoare triple {359#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {356#true} is VALID [2018-11-23 13:00:27,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {356#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {356#true} is VALID [2018-11-23 13:00:27,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {356#true} is VALID [2018-11-23 13:00:27,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {356#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {356#true} is VALID [2018-11-23 13:00:27,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 13:00:27,904 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {356#true} {359#(<= |sll_create_#in~len| sll_create_~len)} #134#return; {359#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:27,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {359#(<= |sll_create_#in~len| sll_create_~len)} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {359#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:27,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {359#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {360#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:00:27,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {360#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {361#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:27,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {361#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {361#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:27,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {361#(<= |sll_create_#in~len| 1)} assume true; {361#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:27,909 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {361#(<= |sll_create_#in~len| 1)} {358#(<= 2 main_~len~0)} #126#return; {357#false} is VALID [2018-11-23 13:00:27,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {357#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {357#false} is VALID [2018-11-23 13:00:27,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {357#false} assume !(~i~0 < ~len~0); {357#false} is VALID [2018-11-23 13:00:27,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {357#false} ~i~0 := 0; {357#false} is VALID [2018-11-23 13:00:27,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {357#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {357#false} is VALID [2018-11-23 13:00:27,911 INFO L256 TraceCheckUtils]: 25: Hoare triple {357#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {356#true} is VALID [2018-11-23 13:00:27,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {356#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {356#true} is VALID [2018-11-23 13:00:27,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {356#true} assume !(~index > 0); {356#true} is VALID [2018-11-23 13:00:27,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {356#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {356#true} is VALID [2018-11-23 13:00:27,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 13:00:27,913 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {356#true} {357#false} #130#return; {357#false} is VALID [2018-11-23 13:00:27,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {357#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {357#false} is VALID [2018-11-23 13:00:27,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {357#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {357#false} is VALID [2018-11-23 13:00:27,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 13:00:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:27,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:27,918 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 13:00:27,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:28,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:28,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 13:00:28,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {356#true} is VALID [2018-11-23 13:00:28,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 13:00:28,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #136#return; {356#true} is VALID [2018-11-23 13:00:28,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret15 := main(); {356#true} is VALID [2018-11-23 13:00:28,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} ~len~0 := 2;~data~0 := 1; {358#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:28,347 INFO L256 TraceCheckUtils]: 6: Hoare triple {358#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {356#true} is VALID [2018-11-23 13:00:28,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {356#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {359#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:28,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {359#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {359#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:28,350 INFO L256 TraceCheckUtils]: 9: Hoare triple {359#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {356#true} is VALID [2018-11-23 13:00:28,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {356#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {356#true} is VALID [2018-11-23 13:00:28,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {356#true} is VALID [2018-11-23 13:00:28,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {356#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {356#true} is VALID [2018-11-23 13:00:28,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 13:00:28,357 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {356#true} {359#(<= |sll_create_#in~len| sll_create_~len)} #134#return; {359#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:28,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {359#(<= |sll_create_#in~len| sll_create_~len)} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {359#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:28,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {359#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {360#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:00:28,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {360#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {361#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:28,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {361#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {361#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:28,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {361#(<= |sll_create_#in~len| 1)} assume true; {361#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:28,366 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {361#(<= |sll_create_#in~len| 1)} {358#(<= 2 main_~len~0)} #126#return; {357#false} is VALID [2018-11-23 13:00:28,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {357#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {357#false} is VALID [2018-11-23 13:00:28,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {357#false} assume !(~i~0 < ~len~0); {357#false} is VALID [2018-11-23 13:00:28,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {357#false} ~i~0 := 0; {357#false} is VALID [2018-11-23 13:00:28,368 INFO L273 TraceCheckUtils]: 24: Hoare triple {357#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {357#false} is VALID [2018-11-23 13:00:28,368 INFO L256 TraceCheckUtils]: 25: Hoare triple {357#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {357#false} is VALID [2018-11-23 13:00:28,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {357#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {357#false} is VALID [2018-11-23 13:00:28,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {357#false} assume !(~index > 0); {357#false} is VALID [2018-11-23 13:00:28,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {357#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {357#false} is VALID [2018-11-23 13:00:28,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {357#false} assume true; {357#false} is VALID [2018-11-23 13:00:28,369 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {357#false} {357#false} #130#return; {357#false} is VALID [2018-11-23 13:00:28,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {357#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {357#false} is VALID [2018-11-23 13:00:28,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {357#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {357#false} is VALID [2018-11-23 13:00:28,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 13:00:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:28,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:28,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:00:28,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 13:00:28,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:28,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:00:28,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:28,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:00:28,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:00:28,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:28,534 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-11-23 13:00:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:29,049 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-23 13:00:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:00:29,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 13:00:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-23 13:00:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-23 13:00:29,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2018-11-23 13:00:29,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:29,215 INFO L225 Difference]: With dead ends: 75 [2018-11-23 13:00:29,215 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:00:29,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:00:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:00:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-23 13:00:29,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:29,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 47 states. [2018-11-23 13:00:29,262 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 47 states. [2018-11-23 13:00:29,263 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 47 states. [2018-11-23 13:00:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:29,267 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 13:00:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 13:00:29,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:29,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:29,268 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 50 states. [2018-11-23 13:00:29,268 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 50 states. [2018-11-23 13:00:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:29,272 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 13:00:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 13:00:29,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:29,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:29,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:29,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:00:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-23 13:00:29,277 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 34 [2018-11-23 13:00:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:29,278 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-23 13:00:29,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:00:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 13:00:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:00:29,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:29,280 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:00:29,280 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:29,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash 599094092, now seen corresponding path program 2 times [2018-11-23 13:00:29,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:29,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:29,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:29,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:29,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {739#true} call ULTIMATE.init(); {739#true} is VALID [2018-11-23 13:00:29,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {739#true} is VALID [2018-11-23 13:00:29,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {739#true} assume true; {739#true} is VALID [2018-11-23 13:00:29,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {739#true} {739#true} #136#return; {739#true} is VALID [2018-11-23 13:00:29,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {739#true} call #t~ret15 := main(); {739#true} is VALID [2018-11-23 13:00:29,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {739#true} ~len~0 := 2;~data~0 := 1; {741#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:29,436 INFO L256 TraceCheckUtils]: 6: Hoare triple {741#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {739#true} is VALID [2018-11-23 13:00:29,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {739#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {739#true} is VALID [2018-11-23 13:00:29,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {739#true} assume !!(~len > 0); {739#true} is VALID [2018-11-23 13:00:29,437 INFO L256 TraceCheckUtils]: 9: Hoare triple {739#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {739#true} is VALID [2018-11-23 13:00:29,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {739#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {739#true} is VALID [2018-11-23 13:00:29,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {739#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {739#true} is VALID [2018-11-23 13:00:29,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {739#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {739#true} is VALID [2018-11-23 13:00:29,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {739#true} assume true; {739#true} is VALID [2018-11-23 13:00:29,438 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {739#true} {739#true} #134#return; {739#true} is VALID [2018-11-23 13:00:29,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {739#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {739#true} is VALID [2018-11-23 13:00:29,439 INFO L273 TraceCheckUtils]: 16: Hoare triple {739#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {739#true} is VALID [2018-11-23 13:00:29,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {739#true} assume !!(~len > 0); {739#true} is VALID [2018-11-23 13:00:29,439 INFO L256 TraceCheckUtils]: 18: Hoare triple {739#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {739#true} is VALID [2018-11-23 13:00:29,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {739#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {739#true} is VALID [2018-11-23 13:00:29,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {739#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {739#true} is VALID [2018-11-23 13:00:29,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {739#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {739#true} is VALID [2018-11-23 13:00:29,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {739#true} assume true; {739#true} is VALID [2018-11-23 13:00:29,441 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {739#true} {739#true} #134#return; {739#true} is VALID [2018-11-23 13:00:29,441 INFO L273 TraceCheckUtils]: 24: Hoare triple {739#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {739#true} is VALID [2018-11-23 13:00:29,442 INFO L273 TraceCheckUtils]: 25: Hoare triple {739#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {739#true} is VALID [2018-11-23 13:00:29,442 INFO L273 TraceCheckUtils]: 26: Hoare triple {739#true} assume !(~len > 0); {739#true} is VALID [2018-11-23 13:00:29,442 INFO L273 TraceCheckUtils]: 27: Hoare triple {739#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {739#true} is VALID [2018-11-23 13:00:29,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {739#true} assume true; {739#true} is VALID [2018-11-23 13:00:29,445 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {739#true} {741#(<= 2 main_~len~0)} #126#return; {741#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:29,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {741#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {742#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 13:00:29,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {742#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !(~i~0 < ~len~0); {740#false} is VALID [2018-11-23 13:00:29,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {740#false} ~i~0 := 0; {740#false} is VALID [2018-11-23 13:00:29,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {740#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {740#false} is VALID [2018-11-23 13:00:29,447 INFO L256 TraceCheckUtils]: 34: Hoare triple {740#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {739#true} is VALID [2018-11-23 13:00:29,448 INFO L273 TraceCheckUtils]: 35: Hoare triple {739#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {739#true} is VALID [2018-11-23 13:00:29,448 INFO L273 TraceCheckUtils]: 36: Hoare triple {739#true} assume !(~index > 0); {739#true} is VALID [2018-11-23 13:00:29,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {739#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {739#true} is VALID [2018-11-23 13:00:29,449 INFO L273 TraceCheckUtils]: 38: Hoare triple {739#true} assume true; {739#true} is VALID [2018-11-23 13:00:29,449 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {739#true} {740#false} #130#return; {740#false} is VALID [2018-11-23 13:00:29,450 INFO L273 TraceCheckUtils]: 40: Hoare triple {740#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {740#false} is VALID [2018-11-23 13:00:29,450 INFO L273 TraceCheckUtils]: 41: Hoare triple {740#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {740#false} is VALID [2018-11-23 13:00:29,451 INFO L273 TraceCheckUtils]: 42: Hoare triple {740#false} assume !false; {740#false} is VALID [2018-11-23 13:00:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 13:00:29,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:29,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:00:29,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-23 13:00:29,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:29,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:00:29,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:29,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:00:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:00:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:00:29,558 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 4 states. [2018-11-23 13:00:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:29,845 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-23 13:00:29,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:00:29,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-23 13:00:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-23 13:00:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-23 13:00:29,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2018-11-23 13:00:29,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:29,993 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:00:29,993 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:00:29,994 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 13:00:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:00:30,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-11-23 13:00:30,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:30,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 48 states. [2018-11-23 13:00:30,051 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 48 states. [2018-11-23 13:00:30,051 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 48 states. [2018-11-23 13:00:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:30,056 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 13:00:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 13:00:30,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:30,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:30,058 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 57 states. [2018-11-23 13:00:30,058 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 57 states. [2018-11-23 13:00:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:30,063 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 13:00:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 13:00:30,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:30,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:30,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:30,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:00:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-23 13:00:30,069 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 43 [2018-11-23 13:00:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:30,069 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-23 13:00:30,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:00:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-23 13:00:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:00:30,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:30,079 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:00:30,079 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:30,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:30,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1358644010, now seen corresponding path program 1 times [2018-11-23 13:00:30,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:30,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:30,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:30,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:00:30,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:30,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {1030#true} call ULTIMATE.init(); {1030#true} is VALID [2018-11-23 13:00:30,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {1030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1030#true} is VALID [2018-11-23 13:00:30,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1030#true} {1030#true} #136#return; {1030#true} is VALID [2018-11-23 13:00:30,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {1030#true} call #t~ret15 := main(); {1030#true} is VALID [2018-11-23 13:00:30,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {1030#true} ~len~0 := 2;~data~0 := 1; {1032#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:30,297 INFO L256 TraceCheckUtils]: 6: Hoare triple {1032#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1030#true} is VALID [2018-11-23 13:00:30,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {1030#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1030#true} is VALID [2018-11-23 13:00:30,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {1030#true} assume !!(~len > 0); {1030#true} is VALID [2018-11-23 13:00:30,298 INFO L256 TraceCheckUtils]: 9: Hoare triple {1030#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1030#true} is VALID [2018-11-23 13:00:30,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1030#true} is VALID [2018-11-23 13:00:30,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {1030#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1030#true} is VALID [2018-11-23 13:00:30,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {1030#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,299 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1030#true} {1030#true} #134#return; {1030#true} is VALID [2018-11-23 13:00:30,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {1030#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {1030#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1030#true} is VALID [2018-11-23 13:00:30,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {1030#true} assume !!(~len > 0); {1030#true} is VALID [2018-11-23 13:00:30,300 INFO L256 TraceCheckUtils]: 18: Hoare triple {1030#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1030#true} is VALID [2018-11-23 13:00:30,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {1030#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1030#true} is VALID [2018-11-23 13:00:30,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {1030#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1030#true} is VALID [2018-11-23 13:00:30,301 INFO L273 TraceCheckUtils]: 21: Hoare triple {1030#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,301 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1030#true} {1030#true} #134#return; {1030#true} is VALID [2018-11-23 13:00:30,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {1030#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,302 INFO L273 TraceCheckUtils]: 25: Hoare triple {1030#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1030#true} is VALID [2018-11-23 13:00:30,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {1030#true} assume !(~len > 0); {1030#true} is VALID [2018-11-23 13:00:30,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {1030#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,309 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1030#true} {1032#(<= 2 main_~len~0)} #126#return; {1032#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:30,310 INFO L273 TraceCheckUtils]: 30: Hoare triple {1032#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1033#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 13:00:30,315 INFO L273 TraceCheckUtils]: 31: Hoare triple {1033#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1033#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 13:00:30,315 INFO L256 TraceCheckUtils]: 32: Hoare triple {1033#(and (<= 2 main_~len~0) (= main_~i~0 0))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1030#true} is VALID [2018-11-23 13:00:30,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {1030#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1030#true} is VALID [2018-11-23 13:00:30,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {1030#true} assume !(~index > 0); {1030#true} is VALID [2018-11-23 13:00:30,316 INFO L273 TraceCheckUtils]: 35: Hoare triple {1030#true} call write~int(~data, ~head.base, ~head.offset, 4); {1030#true} is VALID [2018-11-23 13:00:30,316 INFO L273 TraceCheckUtils]: 36: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,317 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1030#true} {1033#(and (<= 2 main_~len~0) (= main_~i~0 0))} #128#return; {1033#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-23 13:00:30,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {1033#(and (<= 2 main_~len~0) (= main_~i~0 0))} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1034#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-23 13:00:30,323 INFO L273 TraceCheckUtils]: 39: Hoare triple {1034#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {1031#false} is VALID [2018-11-23 13:00:30,323 INFO L273 TraceCheckUtils]: 40: Hoare triple {1031#false} ~i~0 := 0; {1031#false} is VALID [2018-11-23 13:00:30,323 INFO L273 TraceCheckUtils]: 41: Hoare triple {1031#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1031#false} is VALID [2018-11-23 13:00:30,323 INFO L256 TraceCheckUtils]: 42: Hoare triple {1031#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1030#true} is VALID [2018-11-23 13:00:30,324 INFO L273 TraceCheckUtils]: 43: Hoare triple {1030#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1030#true} is VALID [2018-11-23 13:00:30,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {1030#true} assume !(~index > 0); {1030#true} is VALID [2018-11-23 13:00:30,324 INFO L273 TraceCheckUtils]: 45: Hoare triple {1030#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1030#true} is VALID [2018-11-23 13:00:30,324 INFO L273 TraceCheckUtils]: 46: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,325 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {1030#true} {1031#false} #130#return; {1031#false} is VALID [2018-11-23 13:00:30,325 INFO L273 TraceCheckUtils]: 48: Hoare triple {1031#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1031#false} is VALID [2018-11-23 13:00:30,325 INFO L273 TraceCheckUtils]: 49: Hoare triple {1031#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1031#false} is VALID [2018-11-23 13:00:30,325 INFO L273 TraceCheckUtils]: 50: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2018-11-23 13:00:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 13:00:30,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:30,330 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 13:00:30,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:30,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:30,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {1030#true} call ULTIMATE.init(); {1030#true} is VALID [2018-11-23 13:00:30,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {1030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1030#true} is VALID [2018-11-23 13:00:30,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,599 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1030#true} {1030#true} #136#return; {1030#true} is VALID [2018-11-23 13:00:30,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {1030#true} call #t~ret15 := main(); {1030#true} is VALID [2018-11-23 13:00:30,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {1030#true} ~len~0 := 2;~data~0 := 1; {1032#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:30,603 INFO L256 TraceCheckUtils]: 6: Hoare triple {1032#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1030#true} is VALID [2018-11-23 13:00:30,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {1030#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1030#true} is VALID [2018-11-23 13:00:30,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {1030#true} assume !!(~len > 0); {1030#true} is VALID [2018-11-23 13:00:30,604 INFO L256 TraceCheckUtils]: 9: Hoare triple {1030#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1030#true} is VALID [2018-11-23 13:00:30,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1030#true} is VALID [2018-11-23 13:00:30,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {1030#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1030#true} is VALID [2018-11-23 13:00:30,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {1030#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,605 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1030#true} {1030#true} #134#return; {1030#true} is VALID [2018-11-23 13:00:30,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {1030#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {1030#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1030#true} is VALID [2018-11-23 13:00:30,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {1030#true} assume !!(~len > 0); {1030#true} is VALID [2018-11-23 13:00:30,606 INFO L256 TraceCheckUtils]: 18: Hoare triple {1030#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1030#true} is VALID [2018-11-23 13:00:30,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {1030#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1030#true} is VALID [2018-11-23 13:00:30,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {1030#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1030#true} is VALID [2018-11-23 13:00:30,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {1030#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,608 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1030#true} {1030#true} #134#return; {1030#true} is VALID [2018-11-23 13:00:30,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {1030#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {1030#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1030#true} is VALID [2018-11-23 13:00:30,608 INFO L273 TraceCheckUtils]: 26: Hoare triple {1030#true} assume !(~len > 0); {1030#true} is VALID [2018-11-23 13:00:30,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {1030#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1030#true} is VALID [2018-11-23 13:00:30,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,611 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1030#true} {1032#(<= 2 main_~len~0)} #126#return; {1032#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:30,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {1032#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1128#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 13:00:30,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {1128#(and (<= main_~i~0 0) (<= 2 main_~len~0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1128#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 13:00:30,614 INFO L256 TraceCheckUtils]: 32: Hoare triple {1128#(and (<= main_~i~0 0) (<= 2 main_~len~0))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1030#true} is VALID [2018-11-23 13:00:30,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {1030#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1030#true} is VALID [2018-11-23 13:00:30,614 INFO L273 TraceCheckUtils]: 34: Hoare triple {1030#true} assume !(~index > 0); {1030#true} is VALID [2018-11-23 13:00:30,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {1030#true} call write~int(~data, ~head.base, ~head.offset, 4); {1030#true} is VALID [2018-11-23 13:00:30,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-23 13:00:30,615 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1030#true} {1128#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #128#return; {1128#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-23 13:00:30,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {1128#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1153#(and (<= main_~i~0 1) (<= 2 main_~len~0))} is VALID [2018-11-23 13:00:30,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {1153#(and (<= main_~i~0 1) (<= 2 main_~len~0))} assume !(~i~0 < ~len~0); {1031#false} is VALID [2018-11-23 13:00:30,618 INFO L273 TraceCheckUtils]: 40: Hoare triple {1031#false} ~i~0 := 0; {1031#false} is VALID [2018-11-23 13:00:30,618 INFO L273 TraceCheckUtils]: 41: Hoare triple {1031#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1031#false} is VALID [2018-11-23 13:00:30,618 INFO L256 TraceCheckUtils]: 42: Hoare triple {1031#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1031#false} is VALID [2018-11-23 13:00:30,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {1031#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1031#false} is VALID [2018-11-23 13:00:30,619 INFO L273 TraceCheckUtils]: 44: Hoare triple {1031#false} assume !(~index > 0); {1031#false} is VALID [2018-11-23 13:00:30,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {1031#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1031#false} is VALID [2018-11-23 13:00:30,619 INFO L273 TraceCheckUtils]: 46: Hoare triple {1031#false} assume true; {1031#false} is VALID [2018-11-23 13:00:30,619 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {1031#false} {1031#false} #130#return; {1031#false} is VALID [2018-11-23 13:00:30,620 INFO L273 TraceCheckUtils]: 48: Hoare triple {1031#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1031#false} is VALID [2018-11-23 13:00:30,620 INFO L273 TraceCheckUtils]: 49: Hoare triple {1031#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1031#false} is VALID [2018-11-23 13:00:30,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2018-11-23 13:00:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 13:00:30,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:30,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 13:00:30,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 13:00:30,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:30,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:00:30,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:30,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:00:30,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:00:30,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:00:30,735 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 7 states. [2018-11-23 13:00:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:31,185 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-11-23 13:00:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:00:31,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 13:00:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:00:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-23 13:00:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:00:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-23 13:00:31,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2018-11-23 13:00:31,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:31,340 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:00:31,341 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:00:31,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 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 13:00:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:00:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-11-23 13:00:31,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:31,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 51 states. [2018-11-23 13:00:31,386 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 51 states. [2018-11-23 13:00:31,387 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 51 states. [2018-11-23 13:00:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:31,392 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-23 13:00:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-23 13:00:31,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:31,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:31,393 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 67 states. [2018-11-23 13:00:31,393 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 67 states. [2018-11-23 13:00:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:31,398 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-23 13:00:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-23 13:00:31,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:31,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:31,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:31,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:00:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-23 13:00:31,403 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 51 [2018-11-23 13:00:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:31,403 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-23 13:00:31,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:00:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-23 13:00:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 13:00:31,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:31,405 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2018-11-23 13:00:31,406 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:31,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash -337716128, now seen corresponding path program 2 times [2018-11-23 13:00:31,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:31,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:31,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:31,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {1516#true} call ULTIMATE.init(); {1516#true} is VALID [2018-11-23 13:00:31,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {1516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1516#true} is VALID [2018-11-23 13:00:31,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1516#true} {1516#true} #136#return; {1516#true} is VALID [2018-11-23 13:00:31,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {1516#true} call #t~ret15 := main(); {1516#true} is VALID [2018-11-23 13:00:31,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {1516#true} ~len~0 := 2;~data~0 := 1; {1518#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:31,607 INFO L256 TraceCheckUtils]: 6: Hoare triple {1518#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1516#true} is VALID [2018-11-23 13:00:31,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {1516#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1516#true} is VALID [2018-11-23 13:00:31,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {1516#true} assume !!(~len > 0); {1516#true} is VALID [2018-11-23 13:00:31,608 INFO L256 TraceCheckUtils]: 9: Hoare triple {1516#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1516#true} is VALID [2018-11-23 13:00:31,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {1516#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1516#true} is VALID [2018-11-23 13:00:31,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {1516#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1516#true} is VALID [2018-11-23 13:00:31,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {1516#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,609 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1516#true} {1516#true} #134#return; {1516#true} is VALID [2018-11-23 13:00:31,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {1516#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {1516#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1516#true} is VALID [2018-11-23 13:00:31,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {1516#true} assume !!(~len > 0); {1516#true} is VALID [2018-11-23 13:00:31,610 INFO L256 TraceCheckUtils]: 18: Hoare triple {1516#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1516#true} is VALID [2018-11-23 13:00:31,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {1516#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1516#true} is VALID [2018-11-23 13:00:31,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {1516#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1516#true} is VALID [2018-11-23 13:00:31,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {1516#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,611 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1516#true} {1516#true} #134#return; {1516#true} is VALID [2018-11-23 13:00:31,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {1516#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {1516#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1516#true} is VALID [2018-11-23 13:00:31,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {1516#true} assume !(~len > 0); {1516#true} is VALID [2018-11-23 13:00:31,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {1516#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,633 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1516#true} {1518#(<= 2 main_~len~0)} #126#return; {1518#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:31,642 INFO L273 TraceCheckUtils]: 30: Hoare triple {1518#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1518#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:31,653 INFO L273 TraceCheckUtils]: 31: Hoare triple {1518#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1518#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:31,654 INFO L256 TraceCheckUtils]: 32: Hoare triple {1518#(<= 2 main_~len~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1516#true} is VALID [2018-11-23 13:00:31,654 INFO L273 TraceCheckUtils]: 33: Hoare triple {1516#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1516#true} is VALID [2018-11-23 13:00:31,654 INFO L273 TraceCheckUtils]: 34: Hoare triple {1516#true} assume !(~index > 0); {1516#true} is VALID [2018-11-23 13:00:31,654 INFO L273 TraceCheckUtils]: 35: Hoare triple {1516#true} call write~int(~data, ~head.base, ~head.offset, 4); {1516#true} is VALID [2018-11-23 13:00:31,655 INFO L273 TraceCheckUtils]: 36: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,656 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1516#true} {1518#(<= 2 main_~len~0)} #128#return; {1518#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:31,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {1518#(<= 2 main_~len~0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1518#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:31,657 INFO L273 TraceCheckUtils]: 39: Hoare triple {1518#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1518#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:31,657 INFO L256 TraceCheckUtils]: 40: Hoare triple {1518#(<= 2 main_~len~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1516#true} is VALID [2018-11-23 13:00:31,659 INFO L273 TraceCheckUtils]: 41: Hoare triple {1516#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1519#(<= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-23 13:00:31,660 INFO L273 TraceCheckUtils]: 42: Hoare triple {1519#(<= |sll_update_at_#in~index| sll_update_at_~index)} assume !(~index > 0); {1520#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-23 13:00:31,661 INFO L273 TraceCheckUtils]: 43: Hoare triple {1520#(<= |sll_update_at_#in~index| 0)} call write~int(~data, ~head.base, ~head.offset, 4); {1520#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-23 13:00:31,661 INFO L273 TraceCheckUtils]: 44: Hoare triple {1520#(<= |sll_update_at_#in~index| 0)} assume true; {1520#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-23 13:00:31,663 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1520#(<= |sll_update_at_#in~index| 0)} {1518#(<= 2 main_~len~0)} #128#return; {1521#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2018-11-23 13:00:31,664 INFO L273 TraceCheckUtils]: 46: Hoare triple {1521#(<= (+ main_~i~0 2) main_~len~0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1522#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-23 13:00:31,665 INFO L273 TraceCheckUtils]: 47: Hoare triple {1522#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {1517#false} is VALID [2018-11-23 13:00:31,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {1517#false} ~i~0 := 0; {1517#false} is VALID [2018-11-23 13:00:31,666 INFO L273 TraceCheckUtils]: 49: Hoare triple {1517#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1517#false} is VALID [2018-11-23 13:00:31,666 INFO L256 TraceCheckUtils]: 50: Hoare triple {1517#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1516#true} is VALID [2018-11-23 13:00:31,667 INFO L273 TraceCheckUtils]: 51: Hoare triple {1516#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1516#true} is VALID [2018-11-23 13:00:31,667 INFO L273 TraceCheckUtils]: 52: Hoare triple {1516#true} assume !(~index > 0); {1516#true} is VALID [2018-11-23 13:00:31,667 INFO L273 TraceCheckUtils]: 53: Hoare triple {1516#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1516#true} is VALID [2018-11-23 13:00:31,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,668 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1516#true} {1517#false} #130#return; {1517#false} is VALID [2018-11-23 13:00:31,668 INFO L273 TraceCheckUtils]: 56: Hoare triple {1517#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1517#false} is VALID [2018-11-23 13:00:31,669 INFO L273 TraceCheckUtils]: 57: Hoare triple {1517#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1517#false} is VALID [2018-11-23 13:00:31,669 INFO L273 TraceCheckUtils]: 58: Hoare triple {1517#false} assume !false; {1517#false} is VALID [2018-11-23 13:00:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 13:00:31,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:31,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:31,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:00:31,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:00:31,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:00:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:31,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:31,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {1516#true} call ULTIMATE.init(); {1516#true} is VALID [2018-11-23 13:00:31,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {1516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1516#true} is VALID [2018-11-23 13:00:31,978 INFO L273 TraceCheckUtils]: 2: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1516#true} {1516#true} #136#return; {1516#true} is VALID [2018-11-23 13:00:31,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {1516#true} call #t~ret15 := main(); {1516#true} is VALID [2018-11-23 13:00:31,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {1516#true} ~len~0 := 2;~data~0 := 1; {1516#true} is VALID [2018-11-23 13:00:31,980 INFO L256 TraceCheckUtils]: 6: Hoare triple {1516#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1516#true} is VALID [2018-11-23 13:00:31,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {1516#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1516#true} is VALID [2018-11-23 13:00:31,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {1516#true} assume !!(~len > 0); {1516#true} is VALID [2018-11-23 13:00:31,981 INFO L256 TraceCheckUtils]: 9: Hoare triple {1516#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1516#true} is VALID [2018-11-23 13:00:31,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {1516#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1516#true} is VALID [2018-11-23 13:00:31,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {1516#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1516#true} is VALID [2018-11-23 13:00:31,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {1516#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,982 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1516#true} {1516#true} #134#return; {1516#true} is VALID [2018-11-23 13:00:31,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {1516#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {1516#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1516#true} is VALID [2018-11-23 13:00:31,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {1516#true} assume !!(~len > 0); {1516#true} is VALID [2018-11-23 13:00:31,983 INFO L256 TraceCheckUtils]: 18: Hoare triple {1516#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1516#true} is VALID [2018-11-23 13:00:31,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {1516#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1516#true} is VALID [2018-11-23 13:00:31,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {1516#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1516#true} is VALID [2018-11-23 13:00:31,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {1516#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,984 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1516#true} {1516#true} #134#return; {1516#true} is VALID [2018-11-23 13:00:31,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {1516#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {1516#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1516#true} is VALID [2018-11-23 13:00:31,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {1516#true} assume !(~len > 0); {1516#true} is VALID [2018-11-23 13:00:31,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {1516#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1516#true} is VALID [2018-11-23 13:00:31,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,986 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1516#true} {1516#true} #126#return; {1516#true} is VALID [2018-11-23 13:00:31,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {1516#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1616#(<= 0 main_~i~0)} is VALID [2018-11-23 13:00:31,989 INFO L273 TraceCheckUtils]: 31: Hoare triple {1616#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1616#(<= 0 main_~i~0)} is VALID [2018-11-23 13:00:31,989 INFO L256 TraceCheckUtils]: 32: Hoare triple {1616#(<= 0 main_~i~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1516#true} is VALID [2018-11-23 13:00:31,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {1516#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1516#true} is VALID [2018-11-23 13:00:31,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {1516#true} assume !(~index > 0); {1516#true} is VALID [2018-11-23 13:00:31,990 INFO L273 TraceCheckUtils]: 35: Hoare triple {1516#true} call write~int(~data, ~head.base, ~head.offset, 4); {1516#true} is VALID [2018-11-23 13:00:31,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {1516#true} assume true; {1516#true} is VALID [2018-11-23 13:00:31,991 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1516#true} {1616#(<= 0 main_~i~0)} #128#return; {1616#(<= 0 main_~i~0)} is VALID [2018-11-23 13:00:31,992 INFO L273 TraceCheckUtils]: 38: Hoare triple {1616#(<= 0 main_~i~0)} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1641#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:31,992 INFO L273 TraceCheckUtils]: 39: Hoare triple {1641#(<= 1 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1641#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:31,992 INFO L256 TraceCheckUtils]: 40: Hoare triple {1641#(<= 1 main_~i~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1516#true} is VALID [2018-11-23 13:00:31,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {1516#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1519#(<= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-23 13:00:31,995 INFO L273 TraceCheckUtils]: 42: Hoare triple {1519#(<= |sll_update_at_#in~index| sll_update_at_~index)} assume !(~index > 0); {1520#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-23 13:00:31,996 INFO L273 TraceCheckUtils]: 43: Hoare triple {1520#(<= |sll_update_at_#in~index| 0)} call write~int(~data, ~head.base, ~head.offset, 4); {1520#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-23 13:00:31,996 INFO L273 TraceCheckUtils]: 44: Hoare triple {1520#(<= |sll_update_at_#in~index| 0)} assume true; {1520#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-23 13:00:31,998 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1520#(<= |sll_update_at_#in~index| 0)} {1641#(<= 1 main_~i~0)} #128#return; {1517#false} is VALID [2018-11-23 13:00:31,999 INFO L273 TraceCheckUtils]: 46: Hoare triple {1517#false} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1517#false} is VALID [2018-11-23 13:00:31,999 INFO L273 TraceCheckUtils]: 47: Hoare triple {1517#false} assume !(~i~0 < ~len~0); {1517#false} is VALID [2018-11-23 13:00:31,999 INFO L273 TraceCheckUtils]: 48: Hoare triple {1517#false} ~i~0 := 0; {1517#false} is VALID [2018-11-23 13:00:32,000 INFO L273 TraceCheckUtils]: 49: Hoare triple {1517#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1517#false} is VALID [2018-11-23 13:00:32,000 INFO L256 TraceCheckUtils]: 50: Hoare triple {1517#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1517#false} is VALID [2018-11-23 13:00:32,001 INFO L273 TraceCheckUtils]: 51: Hoare triple {1517#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1517#false} is VALID [2018-11-23 13:00:32,001 INFO L273 TraceCheckUtils]: 52: Hoare triple {1517#false} assume !(~index > 0); {1517#false} is VALID [2018-11-23 13:00:32,001 INFO L273 TraceCheckUtils]: 53: Hoare triple {1517#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1517#false} is VALID [2018-11-23 13:00:32,001 INFO L273 TraceCheckUtils]: 54: Hoare triple {1517#false} assume true; {1517#false} is VALID [2018-11-23 13:00:32,002 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1517#false} {1517#false} #130#return; {1517#false} is VALID [2018-11-23 13:00:32,002 INFO L273 TraceCheckUtils]: 56: Hoare triple {1517#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1517#false} is VALID [2018-11-23 13:00:32,002 INFO L273 TraceCheckUtils]: 57: Hoare triple {1517#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1517#false} is VALID [2018-11-23 13:00:32,002 INFO L273 TraceCheckUtils]: 58: Hoare triple {1517#false} assume !false; {1517#false} is VALID [2018-11-23 13:00:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:00:32,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:00:32,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 13:00:32,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-23 13:00:32,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:32,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:00:32,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:32,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:00:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:00:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:00:32,167 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 9 states. [2018-11-23 13:00:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:33,172 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-23 13:00:33,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:00:33,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-23 13:00:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:00:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2018-11-23 13:00:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:00:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2018-11-23 13:00:33,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2018-11-23 13:00:33,301 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 13:00:33,304 INFO L225 Difference]: With dead ends: 84 [2018-11-23 13:00:33,305 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 13:00:33,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 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 13:00:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 13:00:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-11-23 13:00:33,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:33,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 55 states. [2018-11-23 13:00:33,409 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 55 states. [2018-11-23 13:00:33,409 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 55 states. [2018-11-23 13:00:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:33,413 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-23 13:00:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-23 13:00:33,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:33,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:33,414 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 63 states. [2018-11-23 13:00:33,414 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 63 states. [2018-11-23 13:00:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:33,417 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-23 13:00:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-23 13:00:33,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:33,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:33,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:33,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:00:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-23 13:00:33,421 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 59 [2018-11-23 13:00:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:33,422 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-23 13:00:33,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:00:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 13:00:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 13:00:33,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:33,423 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2018-11-23 13:00:33,423 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:33,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:33,424 INFO L82 PathProgramCache]: Analyzing trace with hash 233296567, now seen corresponding path program 1 times [2018-11-23 13:00:33,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:33,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:33,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:33,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:00:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:34,266 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-23 13:00:34,630 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 13:00:34,635 INFO L168 Benchmark]: Toolchain (without parser) took 11227.77 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 861.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.8 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:34,637 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:34,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.52 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 13:00:34,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.3 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:34,639 INFO L168 Benchmark]: Boogie Preprocessor took 41.65 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:34,639 INFO L168 Benchmark]: RCFGBuilder took 1076.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:34,640 INFO L168 Benchmark]: TraceAbstraction took 9315.08 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 132.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -19.5 MB). Peak memory consumption was 112.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:34,645 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 672.52 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 116.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.3 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.65 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1076.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9315.08 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 132.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -19.5 MB). Peak memory consumption was 112.6 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...