/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:37:29,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:37:29,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:37:29,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:37:29,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:37:29,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:37:29,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:37:29,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:37:29,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:37:29,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:37:29,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:37:29,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:37:29,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:37:29,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:37:29,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:37:29,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:37:29,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:37:29,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:37:29,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:37:29,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:37:29,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:37:29,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:37:29,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:37:29,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:37:29,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:37:29,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:37:29,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:37:29,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:37:29,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:37:29,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:37:29,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:37:29,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:37:29,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:37:29,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:37:29,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:37:29,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:37:29,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:37:29,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:37:29,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:37:29,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:37:29,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:37:29,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:37:29,315 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:37:29,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:37:29,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:37:29,316 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:37:29,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:37:29,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:37:29,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:37:29,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:37:29,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:37:29,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:37:29,318 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:37:29,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:37:29,318 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:37:29,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:37:29,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:37:29,319 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:37:29,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:37:29,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:37:29,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:37:29,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:37:29,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:37:29,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:37:29,320 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:37:29,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:37:29,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:37:29,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:37:29,662 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:37:29,663 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:37:29,663 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i [2020-07-08 23:37:29,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fcceed2/9f867ae390fe43efb4e06a3df76c7a52/FLAG0e255b865 [2020-07-08 23:37:30,179 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:37:30,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i [2020-07-08 23:37:30,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fcceed2/9f867ae390fe43efb4e06a3df76c7a52/FLAG0e255b865 [2020-07-08 23:37:30,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fcceed2/9f867ae390fe43efb4e06a3df76c7a52 [2020-07-08 23:37:30,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:37:30,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:37:30,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:37:30,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:37:30,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:37:30,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:37:30" (1/1) ... [2020-07-08 23:37:30,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503b31e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30, skipping insertion in model container [2020-07-08 23:37:30,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:37:30" (1/1) ... [2020-07-08 23:37:30,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:37:30,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:37:30,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:37:30,805 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:37:30,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:37:30,836 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:37:30,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30 WrapperNode [2020-07-08 23:37:30,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:37:30,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:37:30,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:37:30,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:37:30,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30" (1/1) ... [2020-07-08 23:37:30,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30" (1/1) ... [2020-07-08 23:37:30,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30" (1/1) ... [2020-07-08 23:37:30,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30" (1/1) ... [2020-07-08 23:37:30,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30" (1/1) ... [2020-07-08 23:37:30,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30" (1/1) ... [2020-07-08 23:37:30,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30" (1/1) ... [2020-07-08 23:37:30,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:37:30,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:37:30,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:37:30,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:37:30,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30" (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 [2020-07-08 23:37:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:37:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:37:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:37:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2020-07-08 23:37:31,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:37:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:37:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:37:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2020-07-08 23:37:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:37:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:37:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:37:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:37:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:37:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:37:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:37:31,362 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:37:31,362 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 23:37:31,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:37:31 BoogieIcfgContainer [2020-07-08 23:37:31,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:37:31,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:37:31,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:37:31,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:37:31,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:37:30" (1/3) ... [2020-07-08 23:37:31,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e45a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:37:31, skipping insertion in model container [2020-07-08 23:37:31,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:30" (2/3) ... [2020-07-08 23:37:31,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e45a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:37:31, skipping insertion in model container [2020-07-08 23:37:31,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:37:31" (3/3) ... [2020-07-08 23:37:31,373 INFO L109 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc_loop.i [2020-07-08 23:37:31,383 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:37:31,390 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:37:31,401 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:37:31,417 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:37:31,417 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:37:31,417 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:37:31,418 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:37:31,418 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:37:31,418 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:37:31,418 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:37:31,418 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:37:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-08 23:37:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 23:37:31,440 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:31,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:31,441 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash -331406787, now seen corresponding path program 1 times [2020-07-08 23:37:31,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:31,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360639416] [2020-07-08 23:37:31,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:31,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {43#true} is VALID [2020-07-08 23:37:31,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} #valid := #valid[0 := 0]; {43#true} is VALID [2020-07-08 23:37:31,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-08 23:37:31,921 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {43#true} is VALID [2020-07-08 23:37:31,922 INFO L280 TraceCheckUtils]: 4: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 23:37:31,922 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {43#true} {43#true} #55#return; {43#true} is VALID [2020-07-08 23:37:31,926 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {58#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:31,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {43#true} is VALID [2020-07-08 23:37:31,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} #valid := #valid[0 := 0]; {43#true} is VALID [2020-07-08 23:37:31,927 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-08 23:37:31,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {43#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {43#true} is VALID [2020-07-08 23:37:31,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 23:37:31,928 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {43#true} {43#true} #55#return; {43#true} is VALID [2020-07-08 23:37:31,928 INFO L263 TraceCheckUtils]: 7: Hoare triple {43#true} call #t~ret2 := main(); {43#true} is VALID [2020-07-08 23:37:31,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} SUMMARY for call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {51#(= 0 |main_~#pathbuf~0.offset|)} is VALID [2020-07-08 23:37:31,930 INFO L280 TraceCheckUtils]: 9: Hoare triple {51#(= 0 |main_~#pathbuf~0.offset|)} ~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4; {51#(= 0 |main_~#pathbuf~0.offset|)} is VALID [2020-07-08 23:37:31,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {51#(= 0 |main_~#pathbuf~0.offset|)} ~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {52#(and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} is VALID [2020-07-08 23:37:31,934 INFO L263 TraceCheckUtils]: 11: Hoare triple {52#(and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {53#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} is VALID [2020-07-08 23:37:31,935 INFO L280 TraceCheckUtils]: 12: Hoare triple {53#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset; {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-08 23:37:31,937 INFO L280 TraceCheckUtils]: 13: Hoare triple {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} ~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset; {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-08 23:37:31,938 INFO L280 TraceCheckUtils]: 14: Hoare triple {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} havoc ~p~0.base, ~p~0.offset; {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-08 23:37:31,939 INFO L280 TraceCheckUtils]: 15: Hoare triple {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} ~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {55#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:31,940 INFO L280 TraceCheckUtils]: 16: Hoare triple {55#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {55#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:31,942 INFO L263 TraceCheckUtils]: 17: Hoare triple {55#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {56#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:37:31,943 INFO L280 TraceCheckUtils]: 18: Hoare triple {56#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {57#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:37:31,944 INFO L280 TraceCheckUtils]: 19: Hoare triple {57#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {44#false} is VALID [2020-07-08 23:37:31,945 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-08 23:37:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:31,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360639416] [2020-07-08 23:37:31,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:31,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 23:37:31,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921984002] [2020-07-08 23:37:31,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-08 23:37:31,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:31,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 23:37:32,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:32,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 23:37:32,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 23:37:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:37:32,018 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 10 states. [2020-07-08 23:37:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:33,190 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2020-07-08 23:37:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 23:37:33,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-08 23:37:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:37:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2020-07-08 23:37:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:37:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2020-07-08 23:37:33,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2020-07-08 23:37:33,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:33,342 INFO L225 Difference]: With dead ends: 76 [2020-07-08 23:37:33,343 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 23:37:33,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-08 23:37:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 23:37:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-08 23:37:33,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:33,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-08 23:37:33,485 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-08 23:37:33,485 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-08 23:37:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:33,490 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-08 23:37:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-08 23:37:33,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:33,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:33,491 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-08 23:37:33,492 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-08 23:37:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:33,496 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-08 23:37:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-08 23:37:33,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:33,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:33,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:33,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 23:37:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-08 23:37:33,502 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 21 [2020-07-08 23:37:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:33,502 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-08 23:37:33,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 23:37:33,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2020-07-08 23:37:33,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-08 23:37:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:37:33,562 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:33,563 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-08 23:37:33,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:37:33,563 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:33,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:33,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1840112204, now seen corresponding path program 1 times [2020-07-08 23:37:33,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:33,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1817393789] [2020-07-08 23:37:33,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:33,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {388#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {367#true} is VALID [2020-07-08 23:37:33,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} #valid := #valid[0 := 0]; {367#true} is VALID [2020-07-08 23:37:33,871 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume 0 < #StackHeapBarrier; {367#true} is VALID [2020-07-08 23:37:33,871 INFO L280 TraceCheckUtils]: 3: Hoare triple {367#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {367#true} is VALID [2020-07-08 23:37:33,871 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-08 23:37:33,871 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {367#true} {367#true} #55#return; {367#true} is VALID [2020-07-08 23:37:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:33,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {367#true} ~cond := #in~cond; {367#true} is VALID [2020-07-08 23:37:33,885 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} assume !(0 == ~cond); {367#true} is VALID [2020-07-08 23:37:33,885 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-08 23:37:33,886 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {367#true} {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #53#return; {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:33,888 INFO L263 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {388#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:37:33,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {388#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {367#true} is VALID [2020-07-08 23:37:33,888 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} #valid := #valid[0 := 0]; {367#true} is VALID [2020-07-08 23:37:33,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {367#true} assume 0 < #StackHeapBarrier; {367#true} is VALID [2020-07-08 23:37:33,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {367#true} is VALID [2020-07-08 23:37:33,889 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-08 23:37:33,889 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {367#true} {367#true} #55#return; {367#true} is VALID [2020-07-08 23:37:33,890 INFO L263 TraceCheckUtils]: 7: Hoare triple {367#true} call #t~ret2 := main(); {367#true} is VALID [2020-07-08 23:37:33,890 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#true} SUMMARY for call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {375#(= 0 |main_~#pathbuf~0.offset|)} is VALID [2020-07-08 23:37:33,891 INFO L280 TraceCheckUtils]: 9: Hoare triple {375#(= 0 |main_~#pathbuf~0.offset|)} ~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4; {375#(= 0 |main_~#pathbuf~0.offset|)} is VALID [2020-07-08 23:37:33,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#(= 0 |main_~#pathbuf~0.offset|)} ~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {376#(and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} is VALID [2020-07-08 23:37:33,894 INFO L263 TraceCheckUtils]: 11: Hoare triple {376#(and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {377#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} is VALID [2020-07-08 23:37:33,895 INFO L280 TraceCheckUtils]: 12: Hoare triple {377#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset; {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-08 23:37:33,896 INFO L280 TraceCheckUtils]: 13: Hoare triple {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} ~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset; {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-08 23:37:33,896 INFO L280 TraceCheckUtils]: 14: Hoare triple {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} havoc ~p~0.base, ~p~0.offset; {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-08 23:37:33,897 INFO L280 TraceCheckUtils]: 15: Hoare triple {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} ~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:33,898 INFO L280 TraceCheckUtils]: 16: Hoare triple {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:33,898 INFO L263 TraceCheckUtils]: 17: Hoare triple {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {367#true} is VALID [2020-07-08 23:37:33,899 INFO L280 TraceCheckUtils]: 18: Hoare triple {367#true} ~cond := #in~cond; {367#true} is VALID [2020-07-08 23:37:33,899 INFO L280 TraceCheckUtils]: 19: Hoare triple {367#true} assume !(0 == ~cond); {367#true} is VALID [2020-07-08 23:37:33,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-08 23:37:33,901 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {367#true} {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #53#return; {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:33,901 INFO L280 TraceCheckUtils]: 22: Hoare triple {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L20-1 {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:33,902 INFO L280 TraceCheckUtils]: 23: Hoare triple {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; {384#(and (<= 4 ~tmp~0.offset) (= |glob2_#t~post0.base| ~tmp~0.base) (= 0 |glob2_#t~post0.offset|))} is VALID [2020-07-08 23:37:33,903 INFO L280 TraceCheckUtils]: 24: Hoare triple {384#(and (<= 4 ~tmp~0.offset) (= |glob2_#t~post0.base| ~tmp~0.base) (= 0 |glob2_#t~post0.offset|))} ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:33,904 INFO L280 TraceCheckUtils]: 25: Hoare triple {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} havoc #t~post0.base, #t~post0.offset; {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:33,924 INFO L280 TraceCheckUtils]: 26: Hoare triple {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 23:37:33,928 INFO L263 TraceCheckUtils]: 27: Hoare triple {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {386#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:37:33,930 INFO L280 TraceCheckUtils]: 28: Hoare triple {386#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {387#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:37:33,931 INFO L280 TraceCheckUtils]: 29: Hoare triple {387#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {368#false} is VALID [2020-07-08 23:37:33,931 INFO L280 TraceCheckUtils]: 30: Hoare triple {368#false} assume !false; {368#false} is VALID [2020-07-08 23:37:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:33,936 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1817393789] [2020-07-08 23:37:33,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:33,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-08 23:37:33,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397991587] [2020-07-08 23:37:33,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-08 23:37:33,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:33,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 23:37:33,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:33,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 23:37:33,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 23:37:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-08 23:37:33,984 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 12 states. [2020-07-08 23:37:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:35,147 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-08 23:37:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 23:37:35,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-08 23:37:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 23:37:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2020-07-08 23:37:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 23:37:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2020-07-08 23:37:35,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 46 transitions. [2020-07-08 23:37:35,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:35,259 INFO L225 Difference]: With dead ends: 49 [2020-07-08 23:37:35,259 INFO L226 Difference]: Without dead ends: 47 [2020-07-08 23:37:35,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2020-07-08 23:37:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-08 23:37:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-07-08 23:37:35,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:35,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 44 states. [2020-07-08 23:37:35,448 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 44 states. [2020-07-08 23:37:35,448 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 44 states. [2020-07-08 23:37:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:35,456 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-08 23:37:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-07-08 23:37:35,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:35,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:35,457 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 47 states. [2020-07-08 23:37:35,458 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 47 states. [2020-07-08 23:37:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:35,466 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-08 23:37:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-07-08 23:37:35,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:35,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:35,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:35,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 23:37:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2020-07-08 23:37:35,478 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 31 [2020-07-08 23:37:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:35,479 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2020-07-08 23:37:35,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 23:37:35,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2020-07-08 23:37:35,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-07-08 23:37:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 23:37:35,554 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:35,554 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-07-08 23:37:35,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:37:35,554 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1122821221, now seen corresponding path program 2 times [2020-07-08 23:37:35,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:35,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [13542327] [2020-07-08 23:37:35,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:37:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:37:35,642 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:37:35,643 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:37:35,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:37:35,720 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:37:35,720 WARN L170 areAnnotationChecker]: glob2ENTRY has no Hoare annotation [2020-07-08 23:37:35,720 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:37:35,721 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:37:35,721 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:37:35,721 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:37:35,721 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:37:35,721 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 23:37:35,721 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:37:35,721 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:37:35,722 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 23:37:35,722 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:37:35,722 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:37:35,722 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:37:35,722 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-08 23:37:35,722 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:37:35,722 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 23:37:35,723 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 23:37:35,723 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 23:37:35,723 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 23:37:35,723 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 23:37:35,723 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 23:37:35,723 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 23:37:35,724 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 23:37:35,724 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:37:35,724 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:37:35,724 WARN L170 areAnnotationChecker]: L18-5 has no Hoare annotation [2020-07-08 23:37:35,724 WARN L170 areAnnotationChecker]: L18-5 has no Hoare annotation [2020-07-08 23:37:35,724 WARN L170 areAnnotationChecker]: L18-5 has no Hoare annotation [2020-07-08 23:37:35,724 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-08 23:37:35,729 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 23:37:35,730 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:37:35,730 WARN L170 areAnnotationChecker]: L18-6 has no Hoare annotation [2020-07-08 23:37:35,730 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 23:37:35,730 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 23:37:35,730 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 23:37:35,730 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:37:35,731 WARN L170 areAnnotationChecker]: glob2FINAL has no Hoare annotation [2020-07-08 23:37:35,731 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 23:37:35,731 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-08 23:37:35,731 WARN L170 areAnnotationChecker]: glob2EXIT has no Hoare annotation [2020-07-08 23:37:35,731 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 23:37:35,731 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-08 23:37:35,731 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-08 23:37:35,731 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:37:35,731 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:37:35,731 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. [2020-07-08 23:37:35,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:37:35 BoogieIcfgContainer [2020-07-08 23:37:35,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:37:35,737 INFO L168 Benchmark]: Toolchain (without parser) took 5173.21 ms. Allocated memory was 140.5 MB in the beginning and 271.6 MB in the end (delta: 131.1 MB). Free memory was 105.7 MB in the beginning and 180.9 MB in the end (delta: -75.1 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:35,738 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 124.0 MB in the beginning and 123.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:37:35,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.31 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 95.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:35,740 INFO L168 Benchmark]: Boogie Preprocessor took 142.22 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 95.3 MB in the beginning and 180.6 MB in the end (delta: -85.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:35,740 INFO L168 Benchmark]: RCFGBuilder took 386.21 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 159.3 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:35,741 INFO L168 Benchmark]: TraceAbstraction took 4367.35 ms. Allocated memory was 202.9 MB in the beginning and 271.6 MB in the end (delta: 68.7 MB). Free memory was 158.7 MB in the beginning and 180.9 MB in the end (delta: -22.2 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:35,745 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 124.0 MB in the beginning and 123.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 271.31 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 95.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.22 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 95.3 MB in the beginning and 180.6 MB in the end (delta: -85.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.21 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 159.3 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4367.35 ms. Allocated memory was 202.9 MB in the beginning and 271.6 MB in the end (delta: 68.7 MB). Free memory was 158.7 MB in the beginning and 180.9 MB in the end (delta: -22.2 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] Char *tmp; VAL [\old(tmp)=32, \old(tmp)=30, tmp={0:0}] [L29] Char pathbuf[1 +1]; VAL [\old(tmp)=0, \old(tmp)=0, pathbuf={2:0}, tmp={0:0}] [L31] Char *bound = pathbuf + sizeof(pathbuf) - 1; VAL [\old(tmp)=0, \old(tmp)=0, bound={2:28}, pathbuf={2:0}, tmp={0:0}] [L33] tmp = pathbuf + sizeof(pathbuf)/sizeof(*pathbuf) - 1 VAL [\old(tmp)=0, \old(tmp)=0, bound={2:28}, pathbuf={2:0}, tmp={2:4}] [L35] CALL glob2 (pathbuf, bound) VAL [\old(tmp)=0, \old(tmp)=0, pathbuf={2:0}, pathlim={2:28}, tmp={2:4}] [L16] Char *p; VAL [\old(tmp)=0, \old(tmp)=0, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L18] p = pathbuf VAL [\old(tmp)=0, \old(tmp)=0, p={2:0}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={2:0}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={2:4}] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={2:4}] [L20] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={2:0}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L21] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={2:0}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={2:4}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={2:4}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={2:4}] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={2:4}] [L20] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={2:4}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L21] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={2:4}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={2:8}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={2:8}, pathbuf={2:0}, pathbuf={2:0}, pathlim={2:28}, pathlim={2:28}, tmp={2:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, tmp={2:4}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={2:4}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={2:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.2s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 42 SDtfs, 150 SDslu, 153 SDs, 0 SdLazy, 295 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 7150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...