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-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:55:49,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:55:49,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:55:49,370 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:55:49,370 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:55:49,371 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:55:49,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:55:49,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:55:49,377 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:55:49,378 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:55:49,379 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:55:49,379 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:55:49,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:55:49,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:55:49,382 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:55:49,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:55:49,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:55:49,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:55:49,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:55:49,390 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:55:49,391 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:55:49,392 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:55:49,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:55:49,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:55:49,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:55:49,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:55:49,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:55:49,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:55:49,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:55:49,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:55:49,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:55:49,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:55:49,402 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:55:49,403 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:55:49,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:55:49,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:55:49,405 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:55:49,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:55:49,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:55:49,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:55:49,422 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:55:49,423 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:55:49,423 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:55:49,426 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:55:49,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:55:49,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:55:49,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:55:49,427 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:55:49,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:55:49,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:55:49,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:55:49,428 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:55:49,428 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:55:49,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:55:49,429 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:55:49,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:55:49,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:55:49,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:55:49,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:55:49,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:55:49,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:49,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:55:49,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:55:49,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:55:49,434 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:55:49,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:55:49,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:55:49,435 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:55:49,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:55:49,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:55:49,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:55:49,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:55:49,521 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:55:49,521 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-23 12:55:49,577 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb9a206d/92e230fa5059485bab302ee8ec517886/FLAG6b6472052 [2018-11-23 12:55:50,168 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:55:50,169 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-23 12:55:50,184 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb9a206d/92e230fa5059485bab302ee8ec517886/FLAG6b6472052 [2018-11-23 12:55:50,411 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb9a206d/92e230fa5059485bab302ee8ec517886 [2018-11-23 12:55:50,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:55:50,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:55:50,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:50,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:55:50,430 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:55:50,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7407c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50, skipping insertion in model container [2018-11-23 12:55:50,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:55:50,513 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:55:50,951 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:50,967 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:55:51,049 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:51,201 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:55:51,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51 WrapperNode [2018-11-23 12:55:51,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:51,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:51,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:55:51,203 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:55:51,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:51,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:55:51,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:55:51,249 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:55:51,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... [2018-11-23 12:55:51,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:55:51,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:55:51,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:55:51,306 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:55:51,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:55:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:55:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:55:51,374 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:55:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:55:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:55:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:55:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:55:51,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:55:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:55:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:55:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:55:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:55:51,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:55:52,196 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:55:52,197 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:55:52,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:52 BoogieIcfgContainer [2018-11-23 12:55:52,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:55:52,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:55:52,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:55:52,203 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:55:52,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:50" (1/3) ... [2018-11-23 12:55:52,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f9de4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:52, skipping insertion in model container [2018-11-23 12:55:52,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:51" (2/3) ... [2018-11-23 12:55:52,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f9de4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:52, skipping insertion in model container [2018-11-23 12:55:52,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:52" (3/3) ... [2018-11-23 12:55:52,207 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-23 12:55:52,218 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:55:52,227 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:55:52,244 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:55:52,275 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:55:52,276 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:55:52,276 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:55:52,276 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:55:52,276 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:55:52,277 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:55:52,277 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:55:52,277 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:55:52,277 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:55:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 12:55:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:55:52,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:52,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:52,307 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:52,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash 846768608, now seen corresponding path program 1 times [2018-11-23 12:55:52,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:52,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:52,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:52,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 12:55:52,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 12:55:52,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 12:55:52,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #85#return; {33#true} is VALID [2018-11-23 12:55:52,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret10 := main(); {33#true} is VALID [2018-11-23 12:55:52,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {33#true} is VALID [2018-11-23 12:55:52,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {33#true} is VALID [2018-11-23 12:55:52,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {33#true} is VALID [2018-11-23 12:55:52,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 12:55:52,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} call write~int(~i~0, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {34#false} is VALID [2018-11-23 12:55:52,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); {34#false} is VALID [2018-11-23 12:55:52,487 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume 1 != #t~mem6;havoc #t~mem6; {34#false} is VALID [2018-11-23 12:55:52,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 12:55:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:55:52,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:52,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:55:52,497 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:55:52,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:52,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:55:52,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:52,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:55:52,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:55:52,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:52,672 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 12:55:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:52,838 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2018-11-23 12:55:52,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:55:52,839 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:55:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 12:55:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 12:55:52,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2018-11-23 12:55:53,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:53,120 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:55:53,121 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:55:53,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:55:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:55:53,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:53,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:55:53,167 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:55:53,167 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:55:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:53,170 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:55:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:55:53,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:53,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:53,171 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:55:53,172 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:55:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:53,175 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:55:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:55:53,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:53,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:53,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:53,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:55:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 12:55:53,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2018-11-23 12:55:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:53,181 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 12:55:53,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:55:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:55:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:55:53,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:53,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:53,183 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:53,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:53,183 INFO L82 PathProgramCache]: Analyzing trace with hash -56079215, now seen corresponding path program 1 times [2018-11-23 12:55:53,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:53,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:53,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:53,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:53,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:55:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:55:53,268 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #85#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=12, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=12, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] #t~short2 := ~i~0 < 30; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~short2|=true] [?] assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0, |main_#t~short2|=false] [?] assume !#t~short2;havoc #t~nondet1;havoc #t~short2; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem6|=0] [?] assume 1 != #t~mem6;havoc #t~mem6; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633-L640] assume !#t~short2; [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L641] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4); [L642] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L645-L651] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L646] call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L646-L648] assume 1 != #t~mem6; [L646] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L647] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633-L640] assume !#t~short2; [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L641] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4); [L642] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L645-L651] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L646] call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L646-L648] assume 1 != #t~mem6; [L646] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L647] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L629] COND FALSE !(a == 0) VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] i < 30 && __VERIFIER_nondet_int() [L633] i < 30 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={12:0}, i=0, i < 30 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] p->h = i [L642] p->n = 0 [L643] p = a [L644] i = 0 VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L645] COND TRUE p!=0 [L646] EXPR p->h VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}, p->h=0] [L646] COND TRUE p->h != 1 [L647] __VERIFIER_error() VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] ----- [2018-11-23 12:55:53,339 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 12:55:53,339 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:55:53,339 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:55:53,340 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:55:53,342 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:55:53,342 WARN L170 areAnnotationChecker]: L621 has no Hoare annotation [2018-11-23 12:55:53,342 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:55:53,342 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:55:53,343 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:55:53,343 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-23 12:55:53,343 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-23 12:55:53,343 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:55:53,343 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:55:53,343 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-23 12:55:53,343 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-23 12:55:53,344 WARN L170 areAnnotationChecker]: L629-3 has no Hoare annotation [2018-11-23 12:55:53,344 WARN L170 areAnnotationChecker]: L633-5 has no Hoare annotation [2018-11-23 12:55:53,344 WARN L170 areAnnotationChecker]: L633-5 has no Hoare annotation [2018-11-23 12:55:53,344 WARN L170 areAnnotationChecker]: L633-6 has no Hoare annotation [2018-11-23 12:55:53,344 WARN L170 areAnnotationChecker]: L633-1 has no Hoare annotation [2018-11-23 12:55:53,344 WARN L170 areAnnotationChecker]: L633-1 has no Hoare annotation [2018-11-23 12:55:53,348 WARN L170 areAnnotationChecker]: L645-2 has no Hoare annotation [2018-11-23 12:55:53,348 WARN L170 areAnnotationChecker]: L645-2 has no Hoare annotation [2018-11-23 12:55:53,348 WARN L170 areAnnotationChecker]: L645-2 has no Hoare annotation [2018-11-23 12:55:53,348 WARN L170 areAnnotationChecker]: L633-3 has no Hoare annotation [2018-11-23 12:55:53,349 WARN L170 areAnnotationChecker]: L633-3 has no Hoare annotation [2018-11-23 12:55:53,349 WARN L170 areAnnotationChecker]: L645-3 has no Hoare annotation [2018-11-23 12:55:53,349 WARN L170 areAnnotationChecker]: L646 has no Hoare annotation [2018-11-23 12:55:53,349 WARN L170 areAnnotationChecker]: L646 has no Hoare annotation [2018-11-23 12:55:53,349 WARN L170 areAnnotationChecker]: L636 has no Hoare annotation [2018-11-23 12:55:53,349 WARN L170 areAnnotationChecker]: L636 has no Hoare annotation [2018-11-23 12:55:53,349 WARN L170 areAnnotationChecker]: L654-2 has no Hoare annotation [2018-11-23 12:55:53,350 WARN L170 areAnnotationChecker]: L654-2 has no Hoare annotation [2018-11-23 12:55:53,350 WARN L170 areAnnotationChecker]: L654-2 has no Hoare annotation [2018-11-23 12:55:53,350 WARN L170 areAnnotationChecker]: L647 has no Hoare annotation [2018-11-23 12:55:53,350 WARN L170 areAnnotationChecker]: L647 has no Hoare annotation [2018-11-23 12:55:53,350 WARN L170 areAnnotationChecker]: L646-2 has no Hoare annotation [2018-11-23 12:55:53,350 WARN L170 areAnnotationChecker]: L636-1 has no Hoare annotation [2018-11-23 12:55:53,351 WARN L170 areAnnotationChecker]: L636-1 has no Hoare annotation [2018-11-23 12:55:53,351 WARN L170 areAnnotationChecker]: L636-3 has no Hoare annotation [2018-11-23 12:55:53,351 WARN L170 areAnnotationChecker]: L654-3 has no Hoare annotation [2018-11-23 12:55:53,351 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:55:53,351 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:55:53,351 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:55:53,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:55:53 BoogieIcfgContainer [2018-11-23 12:55:53,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:55:53,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:55:53,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:55:53,360 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:55:53,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:52" (3/4) ... [2018-11-23 12:55:53,365 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #85#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=12, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=12, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] #t~short2 := ~i~0 < 30; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~short2|=true] [?] assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0, |main_#t~short2|=false] [?] assume !#t~short2;havoc #t~nondet1;havoc #t~short2; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem6|=0] [?] assume 1 != #t~mem6;havoc #t~mem6; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633-L640] assume !#t~short2; [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L641] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4); [L642] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L645-L651] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L646] call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L646-L648] assume 1 != #t~mem6; [L646] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L647] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633-L640] assume !#t~short2; [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L641] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4); [L642] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L645-L651] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L646] call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L646-L648] assume 1 != #t~mem6; [L646] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L647] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L629] COND FALSE !(a == 0) VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] i < 30 && __VERIFIER_nondet_int() [L633] i < 30 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={12:0}, i=0, i < 30 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] p->h = i [L642] p->n = 0 [L643] p = a [L644] i = 0 VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L645] COND TRUE p!=0 [L646] EXPR p->h VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}, p->h=0] [L646] COND TRUE p->h != 1 [L647] __VERIFIER_error() VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] ----- [2018-11-23 12:55:53,468 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i-witness.graphml [2018-11-23 12:55:53,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:55:53,470 INFO L168 Benchmark]: Toolchain (without parser) took 3045.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -696.8 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:53,472 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:53,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.3 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:53,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:53,474 INFO L168 Benchmark]: Boogie Preprocessor took 57.23 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:53,475 INFO L168 Benchmark]: RCFGBuilder took 891.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:53,477 INFO L168 Benchmark]: TraceAbstraction took 1161.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:53,478 INFO L168 Benchmark]: Witness Printer took 108.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:53,482 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.3 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.23 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 891.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1161.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. * Witness Printer took 108.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 647]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L629] COND FALSE !(a == 0) VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] i < 30 && __VERIFIER_nondet_int() [L633] i < 30 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={12:0}, i=0, i < 30 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] p->h = i [L642] p->n = 0 [L643] p = a [L644] i = 0 VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L645] COND TRUE p!=0 [L646] EXPR p->h VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}, p->h=0] [L646] COND TRUE p->h != 1 [L647] __VERIFIER_error() VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...