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-ext3-properties/sll_nondet_insert_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:01:08,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:01:08,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:01:08,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:01:08,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:01:08,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:01:08,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:01:08,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:01:08,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:01:08,146 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:01:08,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:01:08,147 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:01:08,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:01:08,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:01:08,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:01:08,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:01:08,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:01:08,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:01:08,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:01:08,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:01:08,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:01:08,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:01:08,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:01:08,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:01:08,164 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:01:08,165 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:01:08,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:01:08,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:01:08,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:01:08,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:01:08,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:01:08,170 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:01:08,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:01:08,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:01:08,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:01:08,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:01:08,173 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:01:08,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:01:08,190 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:01:08,191 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:01:08,191 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:01:08,192 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:01:08,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:01:08,192 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:01:08,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:01:08,192 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:01:08,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:01:08,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:01:08,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:01:08,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:01:08,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:01:08,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:01:08,194 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:01:08,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:01:08,194 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:01:08,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:01:08,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:01:08,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:01:08,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:01:08,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:01:08,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:08,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:01:08,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:01:08,196 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:01:08,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:01:08,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:01:08,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:01:08,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:01:08,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:01:08,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:01:08,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:01:08,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:01:08,262 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:01:08,263 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert_true-unreach-call_true-valid-memsafety.i [2018-11-23 13:01:08,331 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff668297/256918006c9a45c6910278e66e281a8d/FLAGf6ecd6ed9 [2018-11-23 13:01:08,913 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:01:08,914 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert_true-unreach-call_true-valid-memsafety.i [2018-11-23 13:01:08,945 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff668297/256918006c9a45c6910278e66e281a8d/FLAGf6ecd6ed9 [2018-11-23 13:01:09,150 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff668297/256918006c9a45c6910278e66e281a8d [2018-11-23 13:01:09,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:01:09,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:01:09,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:09,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:01:09,169 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:01:09,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:09" (1/1) ... [2018-11-23 13:01:09,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aca2415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09, skipping insertion in model container [2018-11-23 13:01:09,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:09" (1/1) ... [2018-11-23 13:01:09,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:01:09,236 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:01:09,731 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:09,742 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:01:09,846 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:09,929 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:01:09,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09 WrapperNode [2018-11-23 13:01:09,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:09,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:09,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:01:09,931 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:01:10,019 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:01:09" (1/1) ... [2018-11-23 13:01:10,044 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:01:09" (1/1) ... [2018-11-23 13:01:10,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:10,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:01:10,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:01:10,066 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:01:10,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09" (1/1) ... [2018-11-23 13:01:10,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09" (1/1) ... [2018-11-23 13:01:10,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09" (1/1) ... [2018-11-23 13:01:10,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09" (1/1) ... [2018-11-23 13:01:10,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09" (1/1) ... [2018-11-23 13:01:10,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09" (1/1) ... [2018-11-23 13:01:10,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09" (1/1) ... [2018-11-23 13:01:10,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:01:10,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:01:10,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:01:10,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:01:10,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09" (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:01:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 13:01:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 13:01:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:01:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-23 13:01:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-23 13:01:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 13:01:10,212 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 13:01:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 13:01:10,212 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 13:01:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:01:10,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:01:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2018-11-23 13:01:10,214 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2018-11-23 13:01:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:01:10,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:01:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:01:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:01:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:01:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 13:01:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-23 13:01:10,217 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-23 13:01:10,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:01:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:01:11,367 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:01:11,369 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:01:11,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:11 BoogieIcfgContainer [2018-11-23 13:01:11,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:01:11,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:01:11,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:01:11,375 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:01:11,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:01:09" (1/3) ... [2018-11-23 13:01:11,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bd3eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:11, skipping insertion in model container [2018-11-23 13:01:11,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:09" (2/3) ... [2018-11-23 13:01:11,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bd3eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:11, skipping insertion in model container [2018-11-23 13:01:11,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:11" (3/3) ... [2018-11-23 13:01:11,378 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_true-unreach-call_true-valid-memsafety.i [2018-11-23 13:01:11,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:01:11,398 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:01:11,412 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:01:11,441 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:01:11,442 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:01:11,442 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:01:11,442 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:01:11,442 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:01:11,442 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:01:11,442 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:01:11,442 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:01:11,443 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:01:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-23 13:01:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:01:11,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:11,471 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:11,474 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:11,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1988832488, now seen corresponding path program 1 times [2018-11-23 13:01:11,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:11,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:11,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:11,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:11,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {68#true} is VALID [2018-11-23 13:01:11,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {68#true} is VALID [2018-11-23 13:01:11,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-23 13:01:11,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #169#return; {68#true} is VALID [2018-11-23 13:01:11,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret22 := main(); {68#true} is VALID [2018-11-23 13:01:11,652 INFO L256 TraceCheckUtils]: 5: Hoare triple {68#true} call #t~ret14 := _get_nondet_int(2, 5); {68#true} is VALID [2018-11-23 13:01:11,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {68#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {68#true} is VALID [2018-11-23 13:01:11,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {68#true} assume !true; {69#false} is VALID [2018-11-23 13:01:11,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {69#false} #res := ~len~1; {69#false} is VALID [2018-11-23 13:01:11,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-23 13:01:11,666 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {69#false} {68#true} #151#return; {69#false} is VALID [2018-11-23 13:01:11,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {69#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {69#false} is VALID [2018-11-23 13:01:11,667 INFO L256 TraceCheckUtils]: 12: Hoare triple {69#false} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {68#true} is VALID [2018-11-23 13:01:11,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {68#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {68#true} is VALID [2018-11-23 13:01:11,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {68#true} assume !true; {68#true} is VALID [2018-11-23 13:01:11,668 INFO L273 TraceCheckUtils]: 15: Hoare triple {68#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {68#true} is VALID [2018-11-23 13:01:11,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-23 13:01:11,669 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {68#true} {69#false} #153#return; {69#false} is VALID [2018-11-23 13:01:11,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {69#false} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {69#false} is VALID [2018-11-23 13:01:11,670 INFO L256 TraceCheckUtils]: 19: Hoare triple {69#false} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {68#true} is VALID [2018-11-23 13:01:11,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {68#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {68#true} is VALID [2018-11-23 13:01:11,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {68#true} assume !true; {68#true} is VALID [2018-11-23 13:01:11,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {68#true} #res := ~len~1; {68#true} is VALID [2018-11-23 13:01:11,671 INFO L273 TraceCheckUtils]: 23: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-23 13:01:11,671 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {68#true} {69#false} #155#return; {69#false} is VALID [2018-11-23 13:01:11,672 INFO L273 TraceCheckUtils]: 25: Hoare triple {69#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {69#false} is VALID [2018-11-23 13:01:11,672 INFO L273 TraceCheckUtils]: 26: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-23 13:01:11,672 INFO L273 TraceCheckUtils]: 27: Hoare triple {69#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {69#false} is VALID [2018-11-23 13:01:11,673 INFO L256 TraceCheckUtils]: 28: Hoare triple {69#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {68#true} is VALID [2018-11-23 13:01:11,673 INFO L273 TraceCheckUtils]: 29: Hoare triple {68#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {68#true} is VALID [2018-11-23 13:01:11,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {68#true} assume !(~head.base != 0 || ~head.offset != 0); {68#true} is VALID [2018-11-23 13:01:11,674 INFO L273 TraceCheckUtils]: 31: Hoare triple {68#true} #res := ~len~0; {68#true} is VALID [2018-11-23 13:01:11,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-23 13:01:11,675 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {68#true} {69#false} #161#return; {69#false} is VALID [2018-11-23 13:01:11,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {69#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {69#false} is VALID [2018-11-23 13:01:11,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {69#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {69#false} is VALID [2018-11-23 13:01:11,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {69#false} assume !false; {69#false} is VALID [2018-11-23 13:01:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:01:11,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:11,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:11,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:11,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:11,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {68#true} is VALID [2018-11-23 13:01:11,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {68#true} is VALID [2018-11-23 13:01:11,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-23 13:01:11,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #169#return; {68#true} is VALID [2018-11-23 13:01:11,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret22 := main(); {68#true} is VALID [2018-11-23 13:01:11,937 INFO L256 TraceCheckUtils]: 5: Hoare triple {68#true} call #t~ret14 := _get_nondet_int(2, 5); {68#true} is VALID [2018-11-23 13:01:11,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {68#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {68#true} is VALID [2018-11-23 13:01:11,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {68#true} assume !true; {69#false} is VALID [2018-11-23 13:01:11,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {69#false} #res := ~len~1; {69#false} is VALID [2018-11-23 13:01:11,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-23 13:01:11,947 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {69#false} {68#true} #151#return; {69#false} is VALID [2018-11-23 13:01:11,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {69#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {69#false} is VALID [2018-11-23 13:01:11,948 INFO L256 TraceCheckUtils]: 12: Hoare triple {69#false} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {69#false} is VALID [2018-11-23 13:01:11,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {69#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {69#false} is VALID [2018-11-23 13:01:11,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-23 13:01:11,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {69#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {69#false} is VALID [2018-11-23 13:01:11,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-23 13:01:11,950 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {69#false} {69#false} #153#return; {69#false} is VALID [2018-11-23 13:01:11,950 INFO L273 TraceCheckUtils]: 18: Hoare triple {69#false} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {69#false} is VALID [2018-11-23 13:01:11,950 INFO L256 TraceCheckUtils]: 19: Hoare triple {69#false} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {69#false} is VALID [2018-11-23 13:01:11,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {69#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {69#false} is VALID [2018-11-23 13:01:11,951 INFO L273 TraceCheckUtils]: 21: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-23 13:01:11,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {69#false} #res := ~len~1; {69#false} is VALID [2018-11-23 13:01:11,952 INFO L273 TraceCheckUtils]: 23: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-23 13:01:11,952 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {69#false} {69#false} #155#return; {69#false} is VALID [2018-11-23 13:01:11,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {69#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {69#false} is VALID [2018-11-23 13:01:11,953 INFO L273 TraceCheckUtils]: 26: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-23 13:01:11,953 INFO L273 TraceCheckUtils]: 27: Hoare triple {69#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {69#false} is VALID [2018-11-23 13:01:11,953 INFO L256 TraceCheckUtils]: 28: Hoare triple {69#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {69#false} is VALID [2018-11-23 13:01:11,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {69#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {69#false} is VALID [2018-11-23 13:01:11,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {69#false} assume !(~head.base != 0 || ~head.offset != 0); {69#false} is VALID [2018-11-23 13:01:11,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {69#false} #res := ~len~0; {69#false} is VALID [2018-11-23 13:01:11,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-23 13:01:11,955 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {69#false} {69#false} #161#return; {69#false} is VALID [2018-11-23 13:01:11,955 INFO L273 TraceCheckUtils]: 34: Hoare triple {69#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {69#false} is VALID [2018-11-23 13:01:11,955 INFO L273 TraceCheckUtils]: 35: Hoare triple {69#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {69#false} is VALID [2018-11-23 13:01:11,956 INFO L273 TraceCheckUtils]: 36: Hoare triple {69#false} assume !false; {69#false} is VALID [2018-11-23 13:01:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:01:11,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:01:11,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2018-11-23 13:01:11,998 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 13:01:12,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:12,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:01:12,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:12,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:01:12,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:01:12,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:01:12,505 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-11-23 13:01:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:12,980 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2018-11-23 13:01:12,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:01:12,980 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 13:01:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:01:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-23 13:01:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:01:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-23 13:01:13,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 166 transitions. [2018-11-23 13:01:13,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:13,504 INFO L225 Difference]: With dead ends: 124 [2018-11-23 13:01:13,504 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:01:13,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:01:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:01:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 13:01:13,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:13,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 13:01:13,580 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 13:01:13,581 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 13:01:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:13,588 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 13:01:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 13:01:13,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:13,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:13,589 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 13:01:13,590 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 13:01:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:13,595 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 13:01:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 13:01:13,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:13,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:13,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:13,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:01:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-11-23 13:01:13,604 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 37 [2018-11-23 13:01:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:13,604 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-23 13:01:13,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:01:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 13:01:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:01:13,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:13,607 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:01:13,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:13,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash -175281280, now seen corresponding path program 1 times [2018-11-23 13:01:13,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:13,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:13,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:13,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:13,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {524#true} call ULTIMATE.init(); {524#true} is VALID [2018-11-23 13:01:13,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {524#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {524#true} is VALID [2018-11-23 13:01:13,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-23 13:01:13,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {524#true} {524#true} #169#return; {524#true} is VALID [2018-11-23 13:01:13,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {524#true} call #t~ret22 := main(); {524#true} is VALID [2018-11-23 13:01:13,822 INFO L256 TraceCheckUtils]: 5: Hoare triple {524#true} call #t~ret14 := _get_nondet_int(2, 5); {524#true} is VALID [2018-11-23 13:01:13,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {524#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {526#(<= (+ _get_nondet_int_~len~1 |_get_nondet_int_#in~until|) (+ _get_nondet_int_~until |_get_nondet_int_#in~from|))} is VALID [2018-11-23 13:01:13,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {526#(<= (+ _get_nondet_int_~len~1 |_get_nondet_int_#in~until|) (+ _get_nondet_int_~until |_get_nondet_int_#in~from|))} #t~short12 := ~len~1 < ~until; {527#(or |_get_nondet_int_#t~short12| (<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|))} is VALID [2018-11-23 13:01:13,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {527#(or |_get_nondet_int_#t~short12| (<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|))} assume !#t~short12; {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 13:01:13,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 13:01:13,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} #res := ~len~1; {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 13:01:13,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} assume true; {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 13:01:13,838 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} {524#true} #151#return; {525#false} is VALID [2018-11-23 13:01:13,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {525#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {525#false} is VALID [2018-11-23 13:01:13,838 INFO L256 TraceCheckUtils]: 14: Hoare triple {525#false} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {524#true} is VALID [2018-11-23 13:01:13,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {524#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {524#true} is VALID [2018-11-23 13:01:13,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {524#true} #t~post2 := ~len;~len := #t~post2 - 1; {524#true} is VALID [2018-11-23 13:01:13,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {524#true} assume !(#t~post2 > 0);havoc #t~post2; {524#true} is VALID [2018-11-23 13:01:13,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {524#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {524#true} is VALID [2018-11-23 13:01:13,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-23 13:01:13,841 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {524#true} {525#false} #153#return; {525#false} is VALID [2018-11-23 13:01:13,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {525#false} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {525#false} is VALID [2018-11-23 13:01:13,842 INFO L256 TraceCheckUtils]: 22: Hoare triple {525#false} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {524#true} is VALID [2018-11-23 13:01:13,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {524#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {524#true} is VALID [2018-11-23 13:01:13,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {524#true} #t~short12 := ~len~1 < ~until; {524#true} is VALID [2018-11-23 13:01:13,842 INFO L273 TraceCheckUtils]: 25: Hoare triple {524#true} assume !#t~short12; {524#true} is VALID [2018-11-23 13:01:13,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {524#true} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {524#true} is VALID [2018-11-23 13:01:13,843 INFO L273 TraceCheckUtils]: 27: Hoare triple {524#true} #res := ~len~1; {524#true} is VALID [2018-11-23 13:01:13,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-23 13:01:13,844 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {524#true} {525#false} #155#return; {525#false} is VALID [2018-11-23 13:01:13,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {525#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {525#false} is VALID [2018-11-23 13:01:13,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {525#false} assume !(~i~0 < ~k~0); {525#false} is VALID [2018-11-23 13:01:13,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {525#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {525#false} is VALID [2018-11-23 13:01:13,845 INFO L256 TraceCheckUtils]: 33: Hoare triple {525#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {524#true} is VALID [2018-11-23 13:01:13,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {524#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {524#true} is VALID [2018-11-23 13:01:13,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {524#true} assume !(~head.base != 0 || ~head.offset != 0); {524#true} is VALID [2018-11-23 13:01:13,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {524#true} #res := ~len~0; {524#true} is VALID [2018-11-23 13:01:13,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-23 13:01:13,847 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {524#true} {525#false} #161#return; {525#false} is VALID [2018-11-23 13:01:13,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {525#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {525#false} is VALID [2018-11-23 13:01:13,847 INFO L273 TraceCheckUtils]: 40: Hoare triple {525#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {525#false} is VALID [2018-11-23 13:01:13,848 INFO L273 TraceCheckUtils]: 41: Hoare triple {525#false} assume !false; {525#false} is VALID [2018-11-23 13:01:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:01:13,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:13,851 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:01:13,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:13,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:14,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {524#true} call ULTIMATE.init(); {524#true} is VALID [2018-11-23 13:01:14,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {524#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {524#true} is VALID [2018-11-23 13:01:14,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-23 13:01:14,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {524#true} {524#true} #169#return; {524#true} is VALID [2018-11-23 13:01:14,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {524#true} call #t~ret22 := main(); {524#true} is VALID [2018-11-23 13:01:14,341 INFO L256 TraceCheckUtils]: 5: Hoare triple {524#true} call #t~ret14 := _get_nondet_int(2, 5); {524#true} is VALID [2018-11-23 13:01:14,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {524#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {550#(and (<= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|) (<= |_get_nondet_int_#in~until| _get_nondet_int_~until))} is VALID [2018-11-23 13:01:14,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {550#(and (<= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|) (<= |_get_nondet_int_#in~until| _get_nondet_int_~until))} #t~short12 := ~len~1 < ~until; {527#(or |_get_nondet_int_#t~short12| (<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|))} is VALID [2018-11-23 13:01:14,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {527#(or |_get_nondet_int_#t~short12| (<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|))} assume !#t~short12; {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 13:01:14,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 13:01:14,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} #res := ~len~1; {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 13:01:14,402 INFO L273 TraceCheckUtils]: 11: Hoare triple {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} assume true; {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 13:01:14,405 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {528#(<= |_get_nondet_int_#in~until| |_get_nondet_int_#in~from|)} {524#true} #151#return; {525#false} is VALID [2018-11-23 13:01:14,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {525#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {525#false} is VALID [2018-11-23 13:01:14,406 INFO L256 TraceCheckUtils]: 14: Hoare triple {525#false} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {525#false} is VALID [2018-11-23 13:01:14,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {525#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {525#false} is VALID [2018-11-23 13:01:14,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {525#false} #t~post2 := ~len;~len := #t~post2 - 1; {525#false} is VALID [2018-11-23 13:01:14,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {525#false} assume !(#t~post2 > 0);havoc #t~post2; {525#false} is VALID [2018-11-23 13:01:14,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {525#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {525#false} is VALID [2018-11-23 13:01:14,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {525#false} assume true; {525#false} is VALID [2018-11-23 13:01:14,407 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {525#false} {525#false} #153#return; {525#false} is VALID [2018-11-23 13:01:14,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {525#false} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {525#false} is VALID [2018-11-23 13:01:14,408 INFO L256 TraceCheckUtils]: 22: Hoare triple {525#false} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {525#false} is VALID [2018-11-23 13:01:14,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {525#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {525#false} is VALID [2018-11-23 13:01:14,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {525#false} #t~short12 := ~len~1 < ~until; {525#false} is VALID [2018-11-23 13:01:14,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {525#false} assume !#t~short12; {525#false} is VALID [2018-11-23 13:01:14,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {525#false} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {525#false} is VALID [2018-11-23 13:01:14,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {525#false} #res := ~len~1; {525#false} is VALID [2018-11-23 13:01:14,409 INFO L273 TraceCheckUtils]: 28: Hoare triple {525#false} assume true; {525#false} is VALID [2018-11-23 13:01:14,410 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {525#false} {525#false} #155#return; {525#false} is VALID [2018-11-23 13:01:14,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {525#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {525#false} is VALID [2018-11-23 13:01:14,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {525#false} assume !(~i~0 < ~k~0); {525#false} is VALID [2018-11-23 13:01:14,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {525#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {525#false} is VALID [2018-11-23 13:01:14,411 INFO L256 TraceCheckUtils]: 33: Hoare triple {525#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {525#false} is VALID [2018-11-23 13:01:14,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {525#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {525#false} is VALID [2018-11-23 13:01:14,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {525#false} assume !(~head.base != 0 || ~head.offset != 0); {525#false} is VALID [2018-11-23 13:01:14,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {525#false} #res := ~len~0; {525#false} is VALID [2018-11-23 13:01:14,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {525#false} assume true; {525#false} is VALID [2018-11-23 13:01:14,412 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {525#false} {525#false} #161#return; {525#false} is VALID [2018-11-23 13:01:14,413 INFO L273 TraceCheckUtils]: 39: Hoare triple {525#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {525#false} is VALID [2018-11-23 13:01:14,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {525#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {525#false} is VALID [2018-11-23 13:01:14,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {525#false} assume !false; {525#false} is VALID [2018-11-23 13:01:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:14,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:01:14,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-23 13:01:14,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-23 13:01:14,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:14,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:01:14,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:14,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:01:14,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:01:14,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:01:14,620 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 6 states. [2018-11-23 13:01:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:15,216 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2018-11-23 13:01:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:01:15,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-23 13:01:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:01:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2018-11-23 13:01:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:01:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2018-11-23 13:01:15,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 138 transitions. [2018-11-23 13:01:15,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:15,548 INFO L225 Difference]: With dead ends: 112 [2018-11-23 13:01:15,548 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:01:15,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:01:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:01:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2018-11-23 13:01:15,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:15,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 59 states. [2018-11-23 13:01:15,603 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 59 states. [2018-11-23 13:01:15,603 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 59 states. [2018-11-23 13:01:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:15,609 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2018-11-23 13:01:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2018-11-23 13:01:15,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:15,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:15,611 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 67 states. [2018-11-23 13:01:15,612 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 67 states. [2018-11-23 13:01:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:15,618 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2018-11-23 13:01:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2018-11-23 13:01:15,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:15,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:15,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:15,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:01:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2018-11-23 13:01:15,624 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 42 [2018-11-23 13:01:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:15,625 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2018-11-23 13:01:15,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:01:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-11-23 13:01:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:01:15,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:15,627 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:01:15,628 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:15,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash 2068702018, now seen corresponding path program 1 times [2018-11-23 13:01:15,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:15,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:15,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:15,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:15,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:16,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {1021#true} call ULTIMATE.init(); {1021#true} is VALID [2018-11-23 13:01:16,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {1021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1021#true} is VALID [2018-11-23 13:01:16,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {1021#true} assume true; {1021#true} is VALID [2018-11-23 13:01:16,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1021#true} {1021#true} #169#return; {1021#true} is VALID [2018-11-23 13:01:16,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {1021#true} call #t~ret22 := main(); {1021#true} is VALID [2018-11-23 13:01:16,039 INFO L256 TraceCheckUtils]: 5: Hoare triple {1021#true} call #t~ret14 := _get_nondet_int(2, 5); {1021#true} is VALID [2018-11-23 13:01:16,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {1021#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:16,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} #t~short12 := ~len~1 < ~until; {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:16,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:16,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:16,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} #res := ~len~1; {1024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} is VALID [2018-11-23 13:01:16,043 INFO L273 TraceCheckUtils]: 11: Hoare triple {1024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} assume true; {1024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} is VALID [2018-11-23 13:01:16,044 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} {1021#true} #151#return; {1025#(<= 2 |main_#t~ret14|)} is VALID [2018-11-23 13:01:16,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {1025#(<= 2 |main_#t~ret14|)} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1026#(<= 2 main_~len~2)} is VALID [2018-11-23 13:01:16,046 INFO L256 TraceCheckUtils]: 14: Hoare triple {1026#(<= 2 main_~len~2)} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {1021#true} is VALID [2018-11-23 13:01:16,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {1021#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1021#true} is VALID [2018-11-23 13:01:16,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {1021#true} #t~post2 := ~len;~len := #t~post2 - 1; {1021#true} is VALID [2018-11-23 13:01:16,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {1021#true} assume !(#t~post2 > 0);havoc #t~post2; {1021#true} is VALID [2018-11-23 13:01:16,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {1021#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1021#true} is VALID [2018-11-23 13:01:16,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {1021#true} assume true; {1021#true} is VALID [2018-11-23 13:01:16,049 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1021#true} {1026#(<= 2 main_~len~2)} #153#return; {1026#(<= 2 main_~len~2)} is VALID [2018-11-23 13:01:16,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {1026#(<= 2 main_~len~2)} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {1026#(<= 2 main_~len~2)} is VALID [2018-11-23 13:01:16,050 INFO L256 TraceCheckUtils]: 22: Hoare triple {1026#(<= 2 main_~len~2)} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {1021#true} is VALID [2018-11-23 13:01:16,052 INFO L273 TraceCheckUtils]: 23: Hoare triple {1021#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1027#(and (or (<= |_get_nondet_int_#in~until| _get_nondet_int_~until) (not (= _get_nondet_int_~len~1 0))) (or (= |_get_nondet_int_#in~from| _get_nondet_int_~len~1) (= _get_nondet_int_~len~1 0)))} is VALID [2018-11-23 13:01:16,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {1027#(and (or (<= |_get_nondet_int_#in~until| _get_nondet_int_~until) (not (= _get_nondet_int_~len~1 0))) (or (= |_get_nondet_int_#in~from| _get_nondet_int_~len~1) (= _get_nondet_int_~len~1 0)))} #t~short12 := ~len~1 < ~until; {1028#(and (or |_get_nondet_int_#t~short12| (<= |_get_nondet_int_#in~until| _get_nondet_int_~len~1) (not (= _get_nondet_int_~len~1 0))) (or (= |_get_nondet_int_#in~from| _get_nondet_int_~len~1) (= _get_nondet_int_~len~1 0)))} is VALID [2018-11-23 13:01:16,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {1028#(and (or |_get_nondet_int_#t~short12| (<= |_get_nondet_int_#in~until| _get_nondet_int_~len~1) (not (= _get_nondet_int_~len~1 0))) (or (= |_get_nondet_int_#in~from| _get_nondet_int_~len~1) (= _get_nondet_int_~len~1 0)))} assume !#t~short12; {1029#(and (or (<= |_get_nondet_int_#in~until| _get_nondet_int_~len~1) (not (= _get_nondet_int_~len~1 0))) (or (= |_get_nondet_int_#in~from| _get_nondet_int_~len~1) (= _get_nondet_int_~len~1 0)))} is VALID [2018-11-23 13:01:16,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {1029#(and (or (<= |_get_nondet_int_#in~until| _get_nondet_int_~len~1) (not (= _get_nondet_int_~len~1 0))) (or (= |_get_nondet_int_#in~from| _get_nondet_int_~len~1) (= _get_nondet_int_~len~1 0)))} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {1029#(and (or (<= |_get_nondet_int_#in~until| _get_nondet_int_~len~1) (not (= _get_nondet_int_~len~1 0))) (or (= |_get_nondet_int_#in~from| _get_nondet_int_~len~1) (= _get_nondet_int_~len~1 0)))} is VALID [2018-11-23 13:01:16,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {1029#(and (or (<= |_get_nondet_int_#in~until| _get_nondet_int_~len~1) (not (= _get_nondet_int_~len~1 0))) (or (= |_get_nondet_int_#in~from| _get_nondet_int_~len~1) (= _get_nondet_int_~len~1 0)))} #res := ~len~1; {1030#(or (not (= |_get_nondet_int_#in~from| 0)) (<= |_get_nondet_int_#in~until| 0))} is VALID [2018-11-23 13:01:16,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {1030#(or (not (= |_get_nondet_int_#in~from| 0)) (<= |_get_nondet_int_#in~until| 0))} assume true; {1030#(or (not (= |_get_nondet_int_#in~from| 0)) (<= |_get_nondet_int_#in~until| 0))} is VALID [2018-11-23 13:01:16,060 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1030#(or (not (= |_get_nondet_int_#in~from| 0)) (<= |_get_nondet_int_#in~until| 0))} {1026#(<= 2 main_~len~2)} #155#return; {1022#false} is VALID [2018-11-23 13:01:16,061 INFO L273 TraceCheckUtils]: 30: Hoare triple {1022#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {1022#false} is VALID [2018-11-23 13:01:16,061 INFO L273 TraceCheckUtils]: 31: Hoare triple {1022#false} assume !(~i~0 < ~k~0); {1022#false} is VALID [2018-11-23 13:01:16,061 INFO L273 TraceCheckUtils]: 32: Hoare triple {1022#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1022#false} is VALID [2018-11-23 13:01:16,062 INFO L256 TraceCheckUtils]: 33: Hoare triple {1022#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {1021#true} is VALID [2018-11-23 13:01:16,062 INFO L273 TraceCheckUtils]: 34: Hoare triple {1021#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1021#true} is VALID [2018-11-23 13:01:16,062 INFO L273 TraceCheckUtils]: 35: Hoare triple {1021#true} assume !(~head.base != 0 || ~head.offset != 0); {1021#true} is VALID [2018-11-23 13:01:16,063 INFO L273 TraceCheckUtils]: 36: Hoare triple {1021#true} #res := ~len~0; {1021#true} is VALID [2018-11-23 13:01:16,063 INFO L273 TraceCheckUtils]: 37: Hoare triple {1021#true} assume true; {1021#true} is VALID [2018-11-23 13:01:16,063 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1021#true} {1022#false} #161#return; {1022#false} is VALID [2018-11-23 13:01:16,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {1022#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {1022#false} is VALID [2018-11-23 13:01:16,064 INFO L273 TraceCheckUtils]: 40: Hoare triple {1022#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {1022#false} is VALID [2018-11-23 13:01:16,064 INFO L273 TraceCheckUtils]: 41: Hoare triple {1022#false} assume !false; {1022#false} is VALID [2018-11-23 13:01:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:01:16,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:16,070 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:01:16,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:16,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:16,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {1021#true} call ULTIMATE.init(); {1021#true} is VALID [2018-11-23 13:01:16,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {1021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1021#true} is VALID [2018-11-23 13:01:16,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {1021#true} assume true; {1021#true} is VALID [2018-11-23 13:01:16,547 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1021#true} {1021#true} #169#return; {1021#true} is VALID [2018-11-23 13:01:16,547 INFO L256 TraceCheckUtils]: 4: Hoare triple {1021#true} call #t~ret22 := main(); {1021#true} is VALID [2018-11-23 13:01:16,548 INFO L256 TraceCheckUtils]: 5: Hoare triple {1021#true} call #t~ret14 := _get_nondet_int(2, 5); {1021#true} is VALID [2018-11-23 13:01:16,549 INFO L273 TraceCheckUtils]: 6: Hoare triple {1021#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:16,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} #t~short12 := ~len~1 < ~until; {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:16,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:16,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:16,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {1023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} #res := ~len~1; {1024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} is VALID [2018-11-23 13:01:16,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {1024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} assume true; {1024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} is VALID [2018-11-23 13:01:16,552 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} {1021#true} #151#return; {1025#(<= 2 |main_#t~ret14|)} is VALID [2018-11-23 13:01:16,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {1025#(<= 2 |main_#t~ret14|)} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1026#(<= 2 main_~len~2)} is VALID [2018-11-23 13:01:16,570 INFO L256 TraceCheckUtils]: 14: Hoare triple {1026#(<= 2 main_~len~2)} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {1021#true} is VALID [2018-11-23 13:01:16,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {1021#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1079#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:01:16,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {1079#(<= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := #t~post2 - 1; {1083#(<= |sll_create_#in~len| |sll_create_#t~post2|)} is VALID [2018-11-23 13:01:16,593 INFO L273 TraceCheckUtils]: 17: Hoare triple {1083#(<= |sll_create_#in~len| |sll_create_#t~post2|)} assume !(#t~post2 > 0);havoc #t~post2; {1087#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:01:16,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {1087#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1087#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:01:16,594 INFO L273 TraceCheckUtils]: 19: Hoare triple {1087#(<= |sll_create_#in~len| 0)} assume true; {1087#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:01:16,595 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1087#(<= |sll_create_#in~len| 0)} {1026#(<= 2 main_~len~2)} #153#return; {1022#false} is VALID [2018-11-23 13:01:16,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {1022#false} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {1022#false} is VALID [2018-11-23 13:01:16,595 INFO L256 TraceCheckUtils]: 22: Hoare triple {1022#false} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {1022#false} is VALID [2018-11-23 13:01:16,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {1022#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1022#false} is VALID [2018-11-23 13:01:16,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {1022#false} #t~short12 := ~len~1 < ~until; {1022#false} is VALID [2018-11-23 13:01:16,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {1022#false} assume !#t~short12; {1022#false} is VALID [2018-11-23 13:01:16,596 INFO L273 TraceCheckUtils]: 26: Hoare triple {1022#false} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {1022#false} is VALID [2018-11-23 13:01:16,596 INFO L273 TraceCheckUtils]: 27: Hoare triple {1022#false} #res := ~len~1; {1022#false} is VALID [2018-11-23 13:01:16,597 INFO L273 TraceCheckUtils]: 28: Hoare triple {1022#false} assume true; {1022#false} is VALID [2018-11-23 13:01:16,597 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1022#false} {1022#false} #155#return; {1022#false} is VALID [2018-11-23 13:01:16,598 INFO L273 TraceCheckUtils]: 30: Hoare triple {1022#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {1022#false} is VALID [2018-11-23 13:01:16,598 INFO L273 TraceCheckUtils]: 31: Hoare triple {1022#false} assume !(~i~0 < ~k~0); {1022#false} is VALID [2018-11-23 13:01:16,598 INFO L273 TraceCheckUtils]: 32: Hoare triple {1022#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1022#false} is VALID [2018-11-23 13:01:16,598 INFO L256 TraceCheckUtils]: 33: Hoare triple {1022#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {1022#false} is VALID [2018-11-23 13:01:16,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {1022#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1022#false} is VALID [2018-11-23 13:01:16,599 INFO L273 TraceCheckUtils]: 35: Hoare triple {1022#false} assume !(~head.base != 0 || ~head.offset != 0); {1022#false} is VALID [2018-11-23 13:01:16,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {1022#false} #res := ~len~0; {1022#false} is VALID [2018-11-23 13:01:16,599 INFO L273 TraceCheckUtils]: 37: Hoare triple {1022#false} assume true; {1022#false} is VALID [2018-11-23 13:01:16,600 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1022#false} {1022#false} #161#return; {1022#false} is VALID [2018-11-23 13:01:16,600 INFO L273 TraceCheckUtils]: 39: Hoare triple {1022#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {1022#false} is VALID [2018-11-23 13:01:16,600 INFO L273 TraceCheckUtils]: 40: Hoare triple {1022#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {1022#false} is VALID [2018-11-23 13:01:16,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {1022#false} assume !false; {1022#false} is VALID [2018-11-23 13:01:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:16,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:01:16,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2018-11-23 13:01:16,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-11-23 13:01:16,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:16,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:01:16,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:16,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:01:16,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:01:16,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:01:16,728 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 13 states. [2018-11-23 13:01:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:18,265 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2018-11-23 13:01:18,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:01:18,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-11-23 13:01:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:01:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 135 transitions. [2018-11-23 13:01:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:01:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 135 transitions. [2018-11-23 13:01:18,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 135 transitions. [2018-11-23 13:01:18,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:18,669 INFO L225 Difference]: With dead ends: 128 [2018-11-23 13:01:18,669 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 13:01:18,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:01:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 13:01:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-11-23 13:01:18,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:18,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 70 states. [2018-11-23 13:01:18,780 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 70 states. [2018-11-23 13:01:18,780 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 70 states. [2018-11-23 13:01:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:18,785 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2018-11-23 13:01:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-23 13:01:18,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:18,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:18,787 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 82 states. [2018-11-23 13:01:18,787 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 82 states. [2018-11-23 13:01:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:18,792 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2018-11-23 13:01:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-23 13:01:18,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:18,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:18,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:18,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:01:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2018-11-23 13:01:18,797 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 42 [2018-11-23 13:01:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:18,797 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2018-11-23 13:01:18,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:01:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2018-11-23 13:01:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:01:18,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:18,799 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:01:18,799 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:18,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:18,800 INFO L82 PathProgramCache]: Analyzing trace with hash -361210585, now seen corresponding path program 1 times [2018-11-23 13:01:18,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:18,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:18,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:18,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:18,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:19,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {1601#true} call ULTIMATE.init(); {1601#true} is VALID [2018-11-23 13:01:19,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {1601#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1601#true} is VALID [2018-11-23 13:01:19,088 INFO L273 TraceCheckUtils]: 2: Hoare triple {1601#true} assume true; {1601#true} is VALID [2018-11-23 13:01:19,088 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1601#true} {1601#true} #169#return; {1601#true} is VALID [2018-11-23 13:01:19,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {1601#true} call #t~ret22 := main(); {1601#true} is VALID [2018-11-23 13:01:19,088 INFO L256 TraceCheckUtils]: 5: Hoare triple {1601#true} call #t~ret14 := _get_nondet_int(2, 5); {1601#true} is VALID [2018-11-23 13:01:19,089 INFO L273 TraceCheckUtils]: 6: Hoare triple {1601#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1601#true} is VALID [2018-11-23 13:01:19,089 INFO L273 TraceCheckUtils]: 7: Hoare triple {1601#true} #t~short12 := ~len~1 < ~until; {1601#true} is VALID [2018-11-23 13:01:19,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {1601#true} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {1601#true} is VALID [2018-11-23 13:01:19,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {1601#true} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {1601#true} is VALID [2018-11-23 13:01:19,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {1601#true} #res := ~len~1; {1601#true} is VALID [2018-11-23 13:01:19,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {1601#true} assume true; {1601#true} is VALID [2018-11-23 13:01:19,090 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1601#true} {1601#true} #151#return; {1601#true} is VALID [2018-11-23 13:01:19,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {1601#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1601#true} is VALID [2018-11-23 13:01:19,091 INFO L256 TraceCheckUtils]: 14: Hoare triple {1601#true} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {1601#true} is VALID [2018-11-23 13:01:19,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {1601#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1601#true} is VALID [2018-11-23 13:01:19,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {1601#true} #t~post2 := ~len;~len := #t~post2 - 1; {1601#true} is VALID [2018-11-23 13:01:19,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {1601#true} assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1603#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:01:19,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {1603#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1603#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:01:19,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {1603#(not (= 0 sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1604#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:19,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {1604#(not (= 0 sll_create_~head~0.base))} #t~post2 := ~len;~len := #t~post2 - 1; {1604#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:19,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {1604#(not (= 0 sll_create_~head~0.base))} assume !(#t~post2 > 0);havoc #t~post2; {1604#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:19,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {1604#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1605#(not (= 0 |sll_create_#res.base|))} is VALID [2018-11-23 13:01:19,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {1605#(not (= 0 |sll_create_#res.base|))} assume true; {1605#(not (= 0 |sll_create_#res.base|))} is VALID [2018-11-23 13:01:19,098 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1605#(not (= 0 |sll_create_#res.base|))} {1601#true} #153#return; {1606#(not (= 0 |main_#t~ret15.base|))} is VALID [2018-11-23 13:01:19,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {1606#(not (= 0 |main_#t~ret15.base|))} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {1607#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 13:01:19,099 INFO L256 TraceCheckUtils]: 26: Hoare triple {1607#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {1601#true} is VALID [2018-11-23 13:01:19,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {1601#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1601#true} is VALID [2018-11-23 13:01:19,099 INFO L273 TraceCheckUtils]: 28: Hoare triple {1601#true} #t~short12 := ~len~1 < ~until; {1601#true} is VALID [2018-11-23 13:01:19,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {1601#true} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {1601#true} is VALID [2018-11-23 13:01:19,100 INFO L273 TraceCheckUtils]: 30: Hoare triple {1601#true} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {1601#true} is VALID [2018-11-23 13:01:19,100 INFO L273 TraceCheckUtils]: 31: Hoare triple {1601#true} #res := ~len~1; {1601#true} is VALID [2018-11-23 13:01:19,100 INFO L273 TraceCheckUtils]: 32: Hoare triple {1601#true} assume true; {1601#true} is VALID [2018-11-23 13:01:19,101 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1601#true} {1607#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} #155#return; {1607#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 13:01:19,102 INFO L273 TraceCheckUtils]: 34: Hoare triple {1607#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {1607#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 13:01:19,102 INFO L273 TraceCheckUtils]: 35: Hoare triple {1607#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !(~i~0 < ~k~0); {1607#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 13:01:19,103 INFO L273 TraceCheckUtils]: 36: Hoare triple {1607#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1608#(not (= 0 |main_#t~mem19.base|))} is VALID [2018-11-23 13:01:19,103 INFO L256 TraceCheckUtils]: 37: Hoare triple {1608#(not (= 0 |main_#t~mem19.base|))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {1601#true} is VALID [2018-11-23 13:01:19,103 INFO L273 TraceCheckUtils]: 38: Hoare triple {1601#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1609#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2018-11-23 13:01:19,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {1609#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {1610#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-23 13:01:19,104 INFO L273 TraceCheckUtils]: 40: Hoare triple {1610#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {1610#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-23 13:01:19,105 INFO L273 TraceCheckUtils]: 41: Hoare triple {1610#(= 0 |sll_length_#in~head.base|)} assume true; {1610#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-23 13:01:19,106 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1610#(= 0 |sll_length_#in~head.base|)} {1608#(not (= 0 |main_#t~mem19.base|))} #161#return; {1602#false} is VALID [2018-11-23 13:01:19,106 INFO L273 TraceCheckUtils]: 43: Hoare triple {1602#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {1602#false} is VALID [2018-11-23 13:01:19,107 INFO L273 TraceCheckUtils]: 44: Hoare triple {1602#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {1602#false} is VALID [2018-11-23 13:01:19,107 INFO L273 TraceCheckUtils]: 45: Hoare triple {1602#false} assume !false; {1602#false} is VALID [2018-11-23 13:01:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:01:19,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:19,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 13:01:19,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-11-23 13:01:19,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:19,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:01:19,284 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:01:19,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:01:19,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:01:19,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:01:19,286 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 10 states. [2018-11-23 13:01:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:20,635 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2018-11-23 13:01:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:01:20,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-11-23 13:01:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:01:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2018-11-23 13:01:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:01:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2018-11-23 13:01:20,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2018-11-23 13:01:20,763 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:01:20,767 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:01:20,768 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 13:01:20,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:01:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 13:01:20,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-11-23 13:01:20,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:20,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 77 states. [2018-11-23 13:01:20,834 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 77 states. [2018-11-23 13:01:20,834 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 77 states. [2018-11-23 13:01:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:20,838 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-23 13:01:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-23 13:01:20,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:20,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:20,839 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 86 states. [2018-11-23 13:01:20,839 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 86 states. [2018-11-23 13:01:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:20,844 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-23 13:01:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-23 13:01:20,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:20,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:20,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:20,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:01:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-11-23 13:01:20,849 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 46 [2018-11-23 13:01:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:20,849 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-23 13:01:20,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:01:20,849 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-11-23 13:01:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 13:01:20,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:20,851 INFO L402 BasicCegarLoop]: trace histogram [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:01:20,851 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:20,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash -280012805, now seen corresponding path program 1 times [2018-11-23 13:01:20,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:20,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:21,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {2021#true} call ULTIMATE.init(); {2021#true} is VALID [2018-11-23 13:01:21,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {2021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2021#true} is VALID [2018-11-23 13:01:21,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {2021#true} assume true; {2021#true} is VALID [2018-11-23 13:01:21,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2021#true} {2021#true} #169#return; {2021#true} is VALID [2018-11-23 13:01:21,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {2021#true} call #t~ret22 := main(); {2021#true} is VALID [2018-11-23 13:01:21,034 INFO L256 TraceCheckUtils]: 5: Hoare triple {2021#true} call #t~ret14 := _get_nondet_int(2, 5); {2021#true} is VALID [2018-11-23 13:01:21,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {2021#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:21,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} #t~short12 := ~len~1 < ~until; {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:21,040 INFO L273 TraceCheckUtils]: 8: Hoare triple {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:21,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:21,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} #res := ~len~1; {2024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} is VALID [2018-11-23 13:01:21,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {2024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} assume true; {2024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} is VALID [2018-11-23 13:01:21,043 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} {2021#true} #151#return; {2025#(<= 2 |main_#t~ret14|)} is VALID [2018-11-23 13:01:21,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {2025#(<= 2 |main_#t~ret14|)} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {2026#(<= 2 main_~len~2)} is VALID [2018-11-23 13:01:21,045 INFO L256 TraceCheckUtils]: 14: Hoare triple {2026#(<= 2 main_~len~2)} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {2021#true} is VALID [2018-11-23 13:01:21,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {2021#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2027#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:01:21,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {2027#(<= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := #t~post2 - 1; {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:21,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:21,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:21,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:21,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post2 := ~len;~len := #t~post2 - 1; {2029#(<= |sll_create_#in~len| (+ |sll_create_#t~post2| 1))} is VALID [2018-11-23 13:01:21,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {2029#(<= |sll_create_#in~len| (+ |sll_create_#t~post2| 1))} assume !(#t~post2 > 0);havoc #t~post2; {2030#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:21,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {2030#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2030#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:21,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {2030#(<= |sll_create_#in~len| 1)} assume true; {2030#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:21,053 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2030#(<= |sll_create_#in~len| 1)} {2026#(<= 2 main_~len~2)} #153#return; {2022#false} is VALID [2018-11-23 13:01:21,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {2022#false} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {2022#false} is VALID [2018-11-23 13:01:21,054 INFO L256 TraceCheckUtils]: 26: Hoare triple {2022#false} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {2021#true} is VALID [2018-11-23 13:01:21,054 INFO L273 TraceCheckUtils]: 27: Hoare triple {2021#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2021#true} is VALID [2018-11-23 13:01:21,055 INFO L273 TraceCheckUtils]: 28: Hoare triple {2021#true} #t~short12 := ~len~1 < ~until; {2021#true} is VALID [2018-11-23 13:01:21,055 INFO L273 TraceCheckUtils]: 29: Hoare triple {2021#true} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {2021#true} is VALID [2018-11-23 13:01:21,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {2021#true} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {2021#true} is VALID [2018-11-23 13:01:21,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {2021#true} #res := ~len~1; {2021#true} is VALID [2018-11-23 13:01:21,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {2021#true} assume true; {2021#true} is VALID [2018-11-23 13:01:21,056 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2021#true} {2022#false} #155#return; {2022#false} is VALID [2018-11-23 13:01:21,056 INFO L273 TraceCheckUtils]: 34: Hoare triple {2022#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {2022#false} is VALID [2018-11-23 13:01:21,056 INFO L273 TraceCheckUtils]: 35: Hoare triple {2022#false} assume !(~i~0 < ~k~0); {2022#false} is VALID [2018-11-23 13:01:21,056 INFO L273 TraceCheckUtils]: 36: Hoare triple {2022#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2022#false} is VALID [2018-11-23 13:01:21,057 INFO L256 TraceCheckUtils]: 37: Hoare triple {2022#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {2021#true} is VALID [2018-11-23 13:01:21,057 INFO L273 TraceCheckUtils]: 38: Hoare triple {2021#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {2021#true} is VALID [2018-11-23 13:01:21,057 INFO L273 TraceCheckUtils]: 39: Hoare triple {2021#true} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2021#true} is VALID [2018-11-23 13:01:21,057 INFO L273 TraceCheckUtils]: 40: Hoare triple {2021#true} assume !(~head.base != 0 || ~head.offset != 0); {2021#true} is VALID [2018-11-23 13:01:21,058 INFO L273 TraceCheckUtils]: 41: Hoare triple {2021#true} #res := ~len~0; {2021#true} is VALID [2018-11-23 13:01:21,058 INFO L273 TraceCheckUtils]: 42: Hoare triple {2021#true} assume true; {2021#true} is VALID [2018-11-23 13:01:21,058 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2021#true} {2022#false} #161#return; {2022#false} is VALID [2018-11-23 13:01:21,058 INFO L273 TraceCheckUtils]: 44: Hoare triple {2022#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {2022#false} is VALID [2018-11-23 13:01:21,058 INFO L273 TraceCheckUtils]: 45: Hoare triple {2022#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {2022#false} is VALID [2018-11-23 13:01:21,059 INFO L273 TraceCheckUtils]: 46: Hoare triple {2022#false} assume !false; {2022#false} is VALID [2018-11-23 13:01:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:01:21,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:21,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:21,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:21,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:21,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {2021#true} call ULTIMATE.init(); {2021#true} is VALID [2018-11-23 13:01:21,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {2021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2021#true} is VALID [2018-11-23 13:01:21,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {2021#true} assume true; {2021#true} is VALID [2018-11-23 13:01:21,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2021#true} {2021#true} #169#return; {2021#true} is VALID [2018-11-23 13:01:21,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {2021#true} call #t~ret22 := main(); {2021#true} is VALID [2018-11-23 13:01:21,328 INFO L256 TraceCheckUtils]: 5: Hoare triple {2021#true} call #t~ret14 := _get_nondet_int(2, 5); {2021#true} is VALID [2018-11-23 13:01:21,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {2021#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:21,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} #t~short12 := ~len~1 < ~until; {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:21,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:21,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} is VALID [2018-11-23 13:01:21,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {2023#(<= |_get_nondet_int_#in~from| _get_nondet_int_~len~1)} #res := ~len~1; {2024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} is VALID [2018-11-23 13:01:21,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {2024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} assume true; {2024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} is VALID [2018-11-23 13:01:21,332 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2024#(<= |_get_nondet_int_#in~from| |_get_nondet_int_#res|)} {2021#true} #151#return; {2025#(<= 2 |main_#t~ret14|)} is VALID [2018-11-23 13:01:21,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {2025#(<= 2 |main_#t~ret14|)} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {2026#(<= 2 main_~len~2)} is VALID [2018-11-23 13:01:21,333 INFO L256 TraceCheckUtils]: 14: Hoare triple {2026#(<= 2 main_~len~2)} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {2021#true} is VALID [2018-11-23 13:01:21,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {2021#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2027#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:01:21,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {2027#(<= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := #t~post2 - 1; {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:21,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:21,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:21,337 INFO L273 TraceCheckUtils]: 19: Hoare triple {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:21,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {2028#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post2 := ~len;~len := #t~post2 - 1; {2029#(<= |sll_create_#in~len| (+ |sll_create_#t~post2| 1))} is VALID [2018-11-23 13:01:21,338 INFO L273 TraceCheckUtils]: 21: Hoare triple {2029#(<= |sll_create_#in~len| (+ |sll_create_#t~post2| 1))} assume !(#t~post2 > 0);havoc #t~post2; {2030#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:21,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {2030#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2030#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:21,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {2030#(<= |sll_create_#in~len| 1)} assume true; {2030#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:21,346 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2030#(<= |sll_create_#in~len| 1)} {2026#(<= 2 main_~len~2)} #153#return; {2022#false} is VALID [2018-11-23 13:01:21,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {2022#false} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {2022#false} is VALID [2018-11-23 13:01:21,346 INFO L256 TraceCheckUtils]: 26: Hoare triple {2022#false} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {2022#false} is VALID [2018-11-23 13:01:21,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {2022#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2022#false} is VALID [2018-11-23 13:01:21,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {2022#false} #t~short12 := ~len~1 < ~until; {2022#false} is VALID [2018-11-23 13:01:21,347 INFO L273 TraceCheckUtils]: 29: Hoare triple {2022#false} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {2022#false} is VALID [2018-11-23 13:01:21,347 INFO L273 TraceCheckUtils]: 30: Hoare triple {2022#false} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {2022#false} is VALID [2018-11-23 13:01:21,348 INFO L273 TraceCheckUtils]: 31: Hoare triple {2022#false} #res := ~len~1; {2022#false} is VALID [2018-11-23 13:01:21,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {2022#false} assume true; {2022#false} is VALID [2018-11-23 13:01:21,348 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2022#false} {2022#false} #155#return; {2022#false} is VALID [2018-11-23 13:01:21,348 INFO L273 TraceCheckUtils]: 34: Hoare triple {2022#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {2022#false} is VALID [2018-11-23 13:01:21,348 INFO L273 TraceCheckUtils]: 35: Hoare triple {2022#false} assume !(~i~0 < ~k~0); {2022#false} is VALID [2018-11-23 13:01:21,349 INFO L273 TraceCheckUtils]: 36: Hoare triple {2022#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2022#false} is VALID [2018-11-23 13:01:21,349 INFO L256 TraceCheckUtils]: 37: Hoare triple {2022#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {2022#false} is VALID [2018-11-23 13:01:21,349 INFO L273 TraceCheckUtils]: 38: Hoare triple {2022#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {2022#false} is VALID [2018-11-23 13:01:21,349 INFO L273 TraceCheckUtils]: 39: Hoare triple {2022#false} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2022#false} is VALID [2018-11-23 13:01:21,349 INFO L273 TraceCheckUtils]: 40: Hoare triple {2022#false} assume !(~head.base != 0 || ~head.offset != 0); {2022#false} is VALID [2018-11-23 13:01:21,349 INFO L273 TraceCheckUtils]: 41: Hoare triple {2022#false} #res := ~len~0; {2022#false} is VALID [2018-11-23 13:01:21,349 INFO L273 TraceCheckUtils]: 42: Hoare triple {2022#false} assume true; {2022#false} is VALID [2018-11-23 13:01:21,350 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2022#false} {2022#false} #161#return; {2022#false} is VALID [2018-11-23 13:01:21,350 INFO L273 TraceCheckUtils]: 44: Hoare triple {2022#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {2022#false} is VALID [2018-11-23 13:01:21,350 INFO L273 TraceCheckUtils]: 45: Hoare triple {2022#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {2022#false} is VALID [2018-11-23 13:01:21,350 INFO L273 TraceCheckUtils]: 46: Hoare triple {2022#false} assume !false; {2022#false} is VALID [2018-11-23 13:01:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:01:21,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:21,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 13:01:21,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 13:01:21,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:21,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:01:21,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:21,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:01:21,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:01:21,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:01:21,426 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 10 states. [2018-11-23 13:01:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:22,095 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2018-11-23 13:01:22,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:01:22,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 13:01:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:01:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2018-11-23 13:01:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:01:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2018-11-23 13:01:22,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 110 transitions. [2018-11-23 13:01:22,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:22,336 INFO L225 Difference]: With dead ends: 134 [2018-11-23 13:01:22,337 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 13:01:22,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:01:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 13:01:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 13:01:22,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:22,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-23 13:01:22,560 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 13:01:22,561 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 13:01:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:22,565 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2018-11-23 13:01:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2018-11-23 13:01:22,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:22,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:22,566 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 13:01:22,567 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 13:01:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:22,570 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2018-11-23 13:01:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2018-11-23 13:01:22,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:22,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:22,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:22,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 13:01:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2018-11-23 13:01:22,575 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 47 [2018-11-23 13:01:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:22,576 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2018-11-23 13:01:22,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:01:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2018-11-23 13:01:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:01:22,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:22,577 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 13:01:22,577 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:22,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2023340660, now seen corresponding path program 2 times [2018-11-23 13:01:22,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:22,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:22,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:23,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {2627#true} call ULTIMATE.init(); {2627#true} is VALID [2018-11-23 13:01:23,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {2627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2627#true} is VALID [2018-11-23 13:01:23,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {2627#true} assume true; {2627#true} is VALID [2018-11-23 13:01:23,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2627#true} {2627#true} #169#return; {2627#true} is VALID [2018-11-23 13:01:23,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {2627#true} call #t~ret22 := main(); {2627#true} is VALID [2018-11-23 13:01:23,138 INFO L256 TraceCheckUtils]: 5: Hoare triple {2627#true} call #t~ret14 := _get_nondet_int(2, 5); {2627#true} is VALID [2018-11-23 13:01:23,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {2627#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2627#true} is VALID [2018-11-23 13:01:23,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {2627#true} #t~short12 := ~len~1 < ~until; {2627#true} is VALID [2018-11-23 13:01:23,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {2627#true} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {2627#true} is VALID [2018-11-23 13:01:23,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {2627#true} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {2627#true} is VALID [2018-11-23 13:01:23,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {2627#true} #res := ~len~1; {2627#true} is VALID [2018-11-23 13:01:23,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {2627#true} assume true; {2627#true} is VALID [2018-11-23 13:01:23,143 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2627#true} {2627#true} #151#return; {2627#true} is VALID [2018-11-23 13:01:23,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {2627#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {2627#true} is VALID [2018-11-23 13:01:23,144 INFO L256 TraceCheckUtils]: 14: Hoare triple {2627#true} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {2627#true} is VALID [2018-11-23 13:01:23,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {2627#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2627#true} is VALID [2018-11-23 13:01:23,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {2627#true} #t~post2 := ~len;~len := #t~post2 - 1; {2627#true} is VALID [2018-11-23 13:01:23,162 INFO L273 TraceCheckUtils]: 17: Hoare triple {2627#true} assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2629#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:01:23,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {2629#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2629#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:01:23,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {2629#(not (= 0 sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2630#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:23,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {2630#(not (= 0 sll_create_~head~0.base))} #t~post2 := ~len;~len := #t~post2 - 1; {2630#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:23,212 INFO L273 TraceCheckUtils]: 21: Hoare triple {2630#(not (= 0 sll_create_~head~0.base))} assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2630#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:23,216 INFO L273 TraceCheckUtils]: 22: Hoare triple {2630#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2630#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:23,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {2630#(not (= 0 sll_create_~head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-23 13:01:23,219 INFO L273 TraceCheckUtils]: 24: Hoare triple {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #t~post2 := ~len;~len := #t~post2 - 1; {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-23 13:01:23,219 INFO L273 TraceCheckUtils]: 25: Hoare triple {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(#t~post2 > 0);havoc #t~post2; {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-23 13:01:23,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2632#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2018-11-23 13:01:23,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {2632#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {2632#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2018-11-23 13:01:23,223 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2632#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {2627#true} #153#return; {2633#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret15.base|) |main_#t~ret15.offset|)))} is VALID [2018-11-23 13:01:23,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {2633#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret15.base|) |main_#t~ret15.offset|)))} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 13:01:23,224 INFO L256 TraceCheckUtils]: 30: Hoare triple {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {2627#true} is VALID [2018-11-23 13:01:23,224 INFO L273 TraceCheckUtils]: 31: Hoare triple {2627#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2627#true} is VALID [2018-11-23 13:01:23,224 INFO L273 TraceCheckUtils]: 32: Hoare triple {2627#true} #t~short12 := ~len~1 < ~until; {2627#true} is VALID [2018-11-23 13:01:23,224 INFO L273 TraceCheckUtils]: 33: Hoare triple {2627#true} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {2627#true} is VALID [2018-11-23 13:01:23,225 INFO L273 TraceCheckUtils]: 34: Hoare triple {2627#true} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {2627#true} is VALID [2018-11-23 13:01:23,225 INFO L273 TraceCheckUtils]: 35: Hoare triple {2627#true} #res := ~len~1; {2627#true} is VALID [2018-11-23 13:01:23,225 INFO L273 TraceCheckUtils]: 36: Hoare triple {2627#true} assume true; {2627#true} is VALID [2018-11-23 13:01:23,227 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2627#true} {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} #155#return; {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 13:01:23,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 13:01:23,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume !(~i~0 < ~k~0); {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 13:01:23,228 INFO L273 TraceCheckUtils]: 40: Hoare triple {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2635#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)))} is VALID [2018-11-23 13:01:23,229 INFO L256 TraceCheckUtils]: 41: Hoare triple {2635#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {2627#true} is VALID [2018-11-23 13:01:23,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {2627#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {2636#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-23 13:01:23,230 INFO L273 TraceCheckUtils]: 43: Hoare triple {2636#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2637#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2018-11-23 13:01:23,230 INFO L273 TraceCheckUtils]: 44: Hoare triple {2637#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {2638#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} is VALID [2018-11-23 13:01:23,230 INFO L273 TraceCheckUtils]: 45: Hoare triple {2638#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} #res := ~len~0; {2638#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} is VALID [2018-11-23 13:01:23,231 INFO L273 TraceCheckUtils]: 46: Hoare triple {2638#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} assume true; {2638#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} is VALID [2018-11-23 13:01:23,232 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2638#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} {2635#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)))} #161#return; {2628#false} is VALID [2018-11-23 13:01:23,232 INFO L273 TraceCheckUtils]: 48: Hoare triple {2628#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {2628#false} is VALID [2018-11-23 13:01:23,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {2628#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {2628#false} is VALID [2018-11-23 13:01:23,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {2628#false} assume !false; {2628#false} is VALID [2018-11-23 13:01:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:01:23,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:23,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:23,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:01:23,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:01:23,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:23,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:23,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:01:23,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:01:23,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:23,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:23,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:23,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-23 13:01:23,454 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:23,455 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_22|, v_sll_create_~head~0.base_5]. (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_22| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_22| sll_create_~head~0.base) sll_create_~head~0.offset v_sll_create_~head~0.base_5))) (not (= 0 v_sll_create_~head~0.base_5))) [2018-11-23 13:01:23,455 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) [2018-11-23 13:01:25,509 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |c_#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))) is different from true [2018-11-23 13:01:25,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-11-23 13:01:25,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-23 13:01:25,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:25,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:25,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:25,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-11-23 13:01:25,756 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:25,756 WARN L384 uantifierElimination]: Input elimination task: ∃ [|main_~#s~0.base|, |main_~#s~0.offset|, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= .cse0 |main_#t~mem19.base|) (= .cse1 |main_#t~mem19.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) [2018-11-23 13:01:25,756 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= .cse0 |main_#t~mem19.base|) (not (= 0 (select (select |#memory_$Pointer$.base| .cse0) |main_#t~mem19.offset|))))) [2018-11-23 13:01:26,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {2627#true} call ULTIMATE.init(); {2627#true} is VALID [2018-11-23 13:01:26,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {2627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2627#true} is VALID [2018-11-23 13:01:26,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {2627#true} assume true; {2627#true} is VALID [2018-11-23 13:01:26,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2627#true} {2627#true} #169#return; {2627#true} is VALID [2018-11-23 13:01:26,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {2627#true} call #t~ret22 := main(); {2627#true} is VALID [2018-11-23 13:01:26,083 INFO L256 TraceCheckUtils]: 5: Hoare triple {2627#true} call #t~ret14 := _get_nondet_int(2, 5); {2627#true} is VALID [2018-11-23 13:01:26,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {2627#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2627#true} is VALID [2018-11-23 13:01:26,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {2627#true} #t~short12 := ~len~1 < ~until; {2627#true} is VALID [2018-11-23 13:01:26,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {2627#true} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {2627#true} is VALID [2018-11-23 13:01:26,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {2627#true} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {2627#true} is VALID [2018-11-23 13:01:26,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {2627#true} #res := ~len~1; {2627#true} is VALID [2018-11-23 13:01:26,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {2627#true} assume true; {2627#true} is VALID [2018-11-23 13:01:26,084 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2627#true} {2627#true} #151#return; {2627#true} is VALID [2018-11-23 13:01:26,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {2627#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~len~2 := #t~ret14;havoc #t~ret14;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {2627#true} is VALID [2018-11-23 13:01:26,084 INFO L256 TraceCheckUtils]: 14: Hoare triple {2627#true} call #t~ret15.base, #t~ret15.offset := sll_create(~len~2); {2627#true} is VALID [2018-11-23 13:01:26,084 INFO L273 TraceCheckUtils]: 15: Hoare triple {2627#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2627#true} is VALID [2018-11-23 13:01:26,085 INFO L273 TraceCheckUtils]: 16: Hoare triple {2627#true} #t~post2 := ~len;~len := #t~post2 - 1; {2627#true} is VALID [2018-11-23 13:01:26,085 INFO L273 TraceCheckUtils]: 17: Hoare triple {2627#true} assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2693#(= sll_create_~new_head~0.offset 0)} is VALID [2018-11-23 13:01:26,086 INFO L273 TraceCheckUtils]: 18: Hoare triple {2693#(= sll_create_~new_head~0.offset 0)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2629#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:01:26,086 INFO L273 TraceCheckUtils]: 19: Hoare triple {2629#(not (= 0 sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2630#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:26,087 INFO L273 TraceCheckUtils]: 20: Hoare triple {2630#(not (= 0 sll_create_~head~0.base))} #t~post2 := ~len;~len := #t~post2 - 1; {2630#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:26,087 INFO L273 TraceCheckUtils]: 21: Hoare triple {2630#(not (= 0 sll_create_~head~0.base))} assume !!(#t~post2 > 0);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2630#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:26,087 INFO L273 TraceCheckUtils]: 22: Hoare triple {2630#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2630#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:26,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {2630#(not (= 0 sll_create_~head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-23 13:01:26,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #t~post2 := ~len;~len := #t~post2 - 1; {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-23 13:01:26,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(#t~post2 > 0);havoc #t~post2; {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-23 13:01:26,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {2631#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2632#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2018-11-23 13:01:26,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {2632#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {2632#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2018-11-23 13:01:26,092 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2632#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {2627#true} #153#return; {2633#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret15.base|) |main_#t~ret15.offset|)))} is VALID [2018-11-23 13:01:26,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {2633#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret15.base|) |main_#t~ret15.offset|)))} call write~init~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret15.base, #t~ret15.offset; {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 13:01:26,095 INFO L256 TraceCheckUtils]: 30: Hoare triple {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~ret16 := _get_nondet_int(0, ~len~2 - 1); {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} is VALID [2018-11-23 13:01:26,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} is VALID [2018-11-23 13:01:26,096 INFO L273 TraceCheckUtils]: 32: Hoare triple {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} #t~short12 := ~len~1 < ~until; {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} is VALID [2018-11-23 13:01:26,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} is VALID [2018-11-23 13:01:26,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} assume !#t~short12;havoc #t~short12;havoc #t~nondet11; {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} is VALID [2018-11-23 13:01:26,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} #res := ~len~1; {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} is VALID [2018-11-23 13:01:26,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} assume true; {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} is VALID [2018-11-23 13:01:26,100 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2733#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| Int) (|v_main_~#s~0.base_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)) (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|)))))} {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} #155#return; {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 13:01:26,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~k~0 := #t~ret16;havoc #t~ret16;~i~0 := 0; {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 13:01:26,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume !(~i~0 < ~k~0); {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 13:01:26,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {2634#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2764#(exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem19.base|) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_#t~mem19.offset|)))))} is VALID [2018-11-23 13:01:26,104 INFO L256 TraceCheckUtils]: 41: Hoare triple {2764#(exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem19.base|) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_#t~mem19.offset|)))))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {2768#(exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 13:01:26,105 INFO L273 TraceCheckUtils]: 42: Hoare triple {2768#(exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {2772#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2018-11-23 13:01:26,106 INFO L273 TraceCheckUtils]: 43: Hoare triple {2772#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2776#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base))} is VALID [2018-11-23 13:01:26,107 INFO L273 TraceCheckUtils]: 44: Hoare triple {2776#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base))} assume !(~head.base != 0 || ~head.offset != 0); {2780#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} is VALID [2018-11-23 13:01:26,108 INFO L273 TraceCheckUtils]: 45: Hoare triple {2780#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} #res := ~len~0; {2780#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} is VALID [2018-11-23 13:01:26,109 INFO L273 TraceCheckUtils]: 46: Hoare triple {2780#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} assume true; {2780#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} is VALID [2018-11-23 13:01:26,111 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2780#(and (exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int) (|v_main_#t~mem19.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |v_main_#t~mem19.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} {2764#(exists ((|main_~#s~0.base| Int) (|main_~#s~0.offset| Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem19.base|) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_#t~mem19.offset|)))))} #161#return; {2628#false} is VALID [2018-11-23 13:01:26,111 INFO L273 TraceCheckUtils]: 48: Hoare triple {2628#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; {2628#false} is VALID [2018-11-23 13:01:26,111 INFO L273 TraceCheckUtils]: 49: Hoare triple {2628#false} assume ~k~0 + ~len~2 != #t~ret20;havoc #t~ret20;havoc #t~mem19.base, #t~mem19.offset; {2628#false} is VALID [2018-11-23 13:01:26,111 INFO L273 TraceCheckUtils]: 50: Hoare triple {2628#false} assume !false; {2628#false} is VALID [2018-11-23 13:01:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:26,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:26,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 19 [2018-11-23 13:01:26,138 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-11-23 13:01:26,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:26,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:01:26,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:26,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:01:26,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:01:26,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=265, Unknown=1, NotChecked=32, Total=342 [2018-11-23 13:01:26,231 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 19 states. [2018-11-23 13:03:14,104 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 25 DAG size of output: 14