./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/veris.c_NetBSD-libc_loop.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/veris.c_NetBSD-libc_loop.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0322173b3e50156a3157d6284ff4dd2480f2ac8d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:12:38,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:12:38,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:12:38,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:12:38,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:12:38,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:12:38,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:12:38,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:12:38,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:12:38,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:12:38,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:12:38,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:12:38,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:12:38,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:12:38,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:12:38,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:12:38,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:12:38,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:12:38,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:12:38,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:12:38,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:12:38,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:12:38,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:12:38,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:12:38,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:12:38,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:12:38,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:12:38,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:12:38,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:12:38,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:12:38,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:12:38,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:12:38,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:12:38,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:12:38,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:12:38,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:12:38,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:12:38,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:12:38,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:12:38,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:12:38,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:12:38,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:12:38,719 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:12:38,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:12:38,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:12:38,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:12:38,721 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:12:38,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:12:38,722 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:12:38,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:12:38,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:12:38,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:12:38,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:12:38,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:12:38,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:12:38,724 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:12:38,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:12:38,725 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:12:38,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:12:38,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:12:38,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:12:38,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:12:38,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:12:38,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:12:38,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:12:38,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:12:38,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:12:38,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:12:38,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:12:38,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:12:38,729 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:12:38,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0322173b3e50156a3157d6284ff4dd2480f2ac8d [2020-07-28 18:12:39,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:12:39,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:12:39,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:12:39,045 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:12:39,045 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:12:39,046 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/veris.c_NetBSD-libc_loop.i [2020-07-28 18:12:39,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6da69116/dc3d5bdda3604f10bb7a2bc737329d6b/FLAGa6bbbaa06 [2020-07-28 18:12:39,581 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:12:39,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_NetBSD-libc_loop.i [2020-07-28 18:12:39,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6da69116/dc3d5bdda3604f10bb7a2bc737329d6b/FLAGa6bbbaa06 [2020-07-28 18:12:39,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6da69116/dc3d5bdda3604f10bb7a2bc737329d6b [2020-07-28 18:12:39,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:12:39,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:12:39,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:39,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:12:39,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:12:39,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:39" (1/1) ... [2020-07-28 18:12:39,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62886f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:39, skipping insertion in model container [2020-07-28 18:12:39,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:39" (1/1) ... [2020-07-28 18:12:39,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:12:40,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:12:40,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:40,207 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:12:40,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:40,297 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:12:40,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40 WrapperNode [2020-07-28 18:12:40,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:40,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:40,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:12:40,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:12:40,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (1/1) ... [2020-07-28 18:12:40,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (1/1) ... [2020-07-28 18:12:40,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:40,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:12:40,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:12:40,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:12:40,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (1/1) ... [2020-07-28 18:12:40,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (1/1) ... [2020-07-28 18:12:40,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (1/1) ... [2020-07-28 18:12:40,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (1/1) ... [2020-07-28 18:12:40,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (1/1) ... [2020-07-28 18:12:40,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (1/1) ... [2020-07-28 18:12:40,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (1/1) ... [2020-07-28 18:12:40,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:12:40,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:12:40,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:12:40,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:12:40,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (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-28 18:12:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 18:12:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:12:40,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:12:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 18:12:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 18:12:40,769 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:12:40,769 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-28 18:12:40,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:40 BoogieIcfgContainer [2020-07-28 18:12:40,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:12:40,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:12:40,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:12:40,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:12:40,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:12:39" (1/3) ... [2020-07-28 18:12:40,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a9c065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:40, skipping insertion in model container [2020-07-28 18:12:40,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:40" (2/3) ... [2020-07-28 18:12:40,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a9c065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:40, skipping insertion in model container [2020-07-28 18:12:40,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:40" (3/3) ... [2020-07-28 18:12:40,784 INFO L109 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc_loop.i [2020-07-28 18:12:40,795 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:12:40,802 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:12:40,812 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:12:40,830 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:12:40,831 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:12:40,831 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:12:40,831 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:12:40,831 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:12:40,831 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:12:40,832 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:12:40,832 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:12:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-07-28 18:12:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:12:40,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:40,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:12:40,852 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:40,856 INFO L82 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2020-07-28 18:12:40,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:40,866 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427600284] [2020-07-28 18:12:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:41,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {16#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {16#true} is VALID [2020-07-28 18:12:41,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {16#true} havoc main_#res;havoc main_#t~ret1, main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;call main_~#pathbuf~0.base, main_~#pathbuf~0.offset := #Ultimate.allocOnStack(8);main_~bound~0.base, main_~bound~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base, glob2_#in~pathlim.offset := main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;havoc glob2_#res;havoc glob2_#t~post0.base, glob2_#t~post0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.base, glob2_~pathlim.offset, glob2_~p~0.base, glob2_~p~0.offset;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {18#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-28 18:12:41,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {18#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {19#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:41,145 INFO L280 TraceCheckUtils]: 3: Hoare triple {19#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {17#false} is VALID [2020-07-28 18:12:41,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {17#false} assume !false; {17#false} is VALID [2020-07-28 18:12:41,148 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-28 18:12:41,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427600284] [2020-07-28 18:12:41,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:41,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:12:41,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031434125] [2020-07-28 18:12:41,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:12:41,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:41,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:12:41,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:41,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:12:41,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:41,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:12:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:12:41,198 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2020-07-28 18:12:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:41,349 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-28 18:12:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:12:41,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:12:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-28 18:12:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-28 18:12:41,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2020-07-28 18:12:41,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:41,441 INFO L225 Difference]: With dead ends: 33 [2020-07-28 18:12:41,442 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 18:12:41,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 18:12:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2020-07-28 18:12:41,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:41,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 10 states. [2020-07-28 18:12:41,487 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 10 states. [2020-07-28 18:12:41,487 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 10 states. [2020-07-28 18:12:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:41,490 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 18:12:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:12:41,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:41,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:41,491 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 12 states. [2020-07-28 18:12:41,491 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 12 states. [2020-07-28 18:12:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:41,493 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 18:12:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 18:12:41,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:41,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:41,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:41,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:12:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-07-28 18:12:41,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-07-28 18:12:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:41,499 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-07-28 18:12:41,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:12:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 18:12:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 18:12:41,500 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:41,500 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:41,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:12:41,501 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:41,501 INFO L82 PathProgramCache]: Analyzing trace with hash -185344033, now seen corresponding path program 1 times [2020-07-28 18:12:41,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:41,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809289095] [2020-07-28 18:12:41,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:41,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {106#true} is VALID [2020-07-28 18:12:41,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} havoc main_#res;havoc main_#t~ret1, main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;call main_~#pathbuf~0.base, main_~#pathbuf~0.offset := #Ultimate.allocOnStack(8);main_~bound~0.base, main_~bound~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base, glob2_#in~pathlim.offset := main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;havoc glob2_#res;havoc glob2_#t~post0.base, glob2_#t~post0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.base, glob2_~pathlim.offset, glob2_~p~0.base, glob2_~p~0.offset;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-28 18:12:41,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-28 18:12:41,657 INFO L280 TraceCheckUtils]: 3: Hoare triple {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} assume !(0 == __VERIFIER_assert_~cond); {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-28 18:12:41,661 INFO L280 TraceCheckUtils]: 4: Hoare triple {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} call write~int(1, glob2_~p~0.base, glob2_~p~0.offset, 4); {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-28 18:12:41,663 INFO L280 TraceCheckUtils]: 5: Hoare triple {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_#t~post0.base, 4 + glob2_#t~post0.offset;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {109#(and (<= ULTIMATE.start_glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:41,667 INFO L280 TraceCheckUtils]: 6: Hoare triple {109#(and (<= ULTIMATE.start_glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {110#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:41,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {110#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {107#false} is VALID [2020-07-28 18:12:41,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {107#false} assume !false; {107#false} is VALID [2020-07-28 18:12:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:41,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809289095] [2020-07-28 18:12:41,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383302599] [2020-07-28 18:12:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:41,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-28 18:12:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:41,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:42,153 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:42,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {106#true} is VALID [2020-07-28 18:12:42,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} havoc main_#res;havoc main_#t~ret1, main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;call main_~#pathbuf~0.base, main_~#pathbuf~0.offset := #Ultimate.allocOnStack(8);main_~bound~0.base, main_~bound~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base, glob2_#in~pathlim.offset := main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;havoc glob2_#res;havoc glob2_#t~post0.base, glob2_#t~post0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.base, glob2_~pathlim.offset, glob2_~p~0.base, glob2_~p~0.offset;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-28 18:12:42,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-28 18:12:42,222 INFO L280 TraceCheckUtils]: 3: Hoare triple {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} assume !(0 == __VERIFIER_assert_~cond); {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-28 18:12:42,223 INFO L280 TraceCheckUtils]: 4: Hoare triple {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} call write~int(1, glob2_~p~0.base, glob2_~p~0.offset, 4); {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-28 18:12:42,225 INFO L280 TraceCheckUtils]: 5: Hoare triple {108#(and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))} glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_#t~post0.base, 4 + glob2_#t~post0.offset;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {109#(and (<= ULTIMATE.start_glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,227 INFO L280 TraceCheckUtils]: 6: Hoare triple {109#(and (<= ULTIMATE.start_glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {132#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:42,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {132#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {107#false} is VALID [2020-07-28 18:12:42,228 INFO L280 TraceCheckUtils]: 8: Hoare triple {107#false} assume !false; {107#false} is VALID [2020-07-28 18:12:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:42,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:42,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-28 18:12:42,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784659982] [2020-07-28 18:12:42,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-28 18:12:42,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:42,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:12:42,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:42,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:12:42,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:42,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:12:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:12:42,253 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2020-07-28 18:12:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:42,402 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-28 18:12:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:12:42,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-28 18:12:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-28 18:12:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-28 18:12:42,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2020-07-28 18:12:42,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:42,438 INFO L225 Difference]: With dead ends: 19 [2020-07-28 18:12:42,438 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 18:12:42,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:12:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 18:12:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-07-28 18:12:42,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:42,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 14 states. [2020-07-28 18:12:42,456 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 14 states. [2020-07-28 18:12:42,457 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 14 states. [2020-07-28 18:12:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:42,459 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-28 18:12:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-28 18:12:42,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:42,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:42,460 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 17 states. [2020-07-28 18:12:42,461 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 17 states. [2020-07-28 18:12:42,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:42,462 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-28 18:12:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-28 18:12:42,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:42,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:42,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:42,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:12:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-28 18:12:42,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 9 [2020-07-28 18:12:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:42,467 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-28 18:12:42,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:12:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-28 18:12:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 18:12:42,468 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:42,468 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2020-07-28 18:12:42,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 18:12:42,683 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:42,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1625670603, now seen corresponding path program 2 times [2020-07-28 18:12:42,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:42,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907963821] [2020-07-28 18:12:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:42,811 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {221#true} is VALID [2020-07-28 18:12:42,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} havoc main_#res;havoc main_#t~ret1, main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;call main_~#pathbuf~0.base, main_~#pathbuf~0.offset := #Ultimate.allocOnStack(8);main_~bound~0.base, main_~bound~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base, glob2_#in~pathlim.offset := main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;havoc glob2_#res;havoc glob2_#t~post0.base, glob2_#t~post0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.base, glob2_~pathlim.offset, glob2_~p~0.base, glob2_~p~0.offset;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,816 INFO L280 TraceCheckUtils]: 3: Hoare triple {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} assume !(0 == __VERIFIER_assert_~cond); {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,818 INFO L280 TraceCheckUtils]: 4: Hoare triple {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} call write~int(1, glob2_~p~0.base, glob2_~p~0.offset, 4); {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_#t~post0.base, 4 + glob2_#t~post0.offset;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,821 INFO L280 TraceCheckUtils]: 6: Hoare triple {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,823 INFO L280 TraceCheckUtils]: 7: Hoare triple {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} assume !(0 == __VERIFIER_assert_~cond); {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,824 INFO L280 TraceCheckUtils]: 8: Hoare triple {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} call write~int(1, glob2_~p~0.base, glob2_~p~0.offset, 4); {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,826 INFO L280 TraceCheckUtils]: 9: Hoare triple {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_#t~post0.base, 4 + glob2_#t~post0.offset;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} is VALID [2020-07-28 18:12:42,828 INFO L280 TraceCheckUtils]: 10: Hoare triple {223#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {224#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:42,829 INFO L280 TraceCheckUtils]: 11: Hoare triple {224#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {222#false} is VALID [2020-07-28 18:12:42,830 INFO L280 TraceCheckUtils]: 12: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-28 18:12:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 18:12:42,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907963821] [2020-07-28 18:12:42,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111753073] [2020-07-28 18:12:42,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:42,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-28 18:12:42,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:42,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-28 18:12:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:42,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:43,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {221#true} is VALID [2020-07-28 18:12:43,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} havoc main_#res;havoc main_#t~ret1, main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;call main_~#pathbuf~0.base, main_~#pathbuf~0.offset := #Ultimate.allocOnStack(8);main_~bound~0.base, main_~bound~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := main_~#pathbuf~0.base, 8 + main_~#pathbuf~0.offset - 4;glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base, glob2_#in~pathlim.offset := main_~#pathbuf~0.base, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset;havoc glob2_#res;havoc glob2_#t~post0.base, glob2_#t~post0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.base, glob2_~pathlim.offset, glob2_~p~0.base, glob2_~p~0.offset;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} is VALID [2020-07-28 18:12:43,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} is VALID [2020-07-28 18:12:43,242 INFO L280 TraceCheckUtils]: 3: Hoare triple {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} assume !(0 == __VERIFIER_assert_~cond); {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} is VALID [2020-07-28 18:12:43,244 INFO L280 TraceCheckUtils]: 4: Hoare triple {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} call write~int(1, glob2_~p~0.base, glob2_~p~0.offset, 4); {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} is VALID [2020-07-28 18:12:43,245 INFO L280 TraceCheckUtils]: 5: Hoare triple {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_#t~post0.base, 4 + glob2_#t~post0.offset;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} is VALID [2020-07-28 18:12:43,246 INFO L280 TraceCheckUtils]: 6: Hoare triple {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} is VALID [2020-07-28 18:12:43,247 INFO L280 TraceCheckUtils]: 7: Hoare triple {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} assume !(0 == __VERIFIER_assert_~cond); {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} is VALID [2020-07-28 18:12:43,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} call write~int(1, glob2_~p~0.base, glob2_~p~0.offset, 4); {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} is VALID [2020-07-28 18:12:43,249 INFO L280 TraceCheckUtils]: 9: Hoare triple {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~0.base, glob2_~p~0.offset;glob2_~p~0.base, glob2_~p~0.offset := glob2_#t~post0.base, 4 + glob2_#t~post0.offset;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} is VALID [2020-07-28 18:12:43,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {231#(and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base))} assume !!(glob2_~p~0.base == glob2_~pathlim.base && glob2_~p~0.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~0.base == ~tmp~0.base && glob2_~p~0.offset <= ~tmp~0.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {259#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:43,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {259#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {222#false} is VALID [2020-07-28 18:12:43,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-28 18:12:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 18:12:43,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:43,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-28 18:12:43,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395065355] [2020-07-28 18:12:43,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-28 18:12:43,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:43,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:12:43,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:43,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:12:43,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:43,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:12:43,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:12:43,276 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2020-07-28 18:12:43,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:43,375 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-28 18:12:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:12:43,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-28 18:12:43,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-28 18:12:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-28 18:12:43,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2020-07-28 18:12:43,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:43,393 INFO L225 Difference]: With dead ends: 14 [2020-07-28 18:12:43,393 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:12:43,394 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:12:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:12:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:12:43,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:43,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:43,395 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:43,395 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:43,395 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:12:43,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:43,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:43,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:43,396 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:43,396 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:43,396 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:12:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:43,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:43,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:43,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:43,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:12:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:12:43,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-28 18:12:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:43,398 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:12:43,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:12:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:43,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:43,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:43,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:12:43,774 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:12:43,774 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 18:12:43,774 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:12:43,777 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:12:43,777 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:12:43,778 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-28 18:12:43,778 INFO L264 CegarLoopResult]: At program point L24(lines 14 25) the Hoare annotation is: (or (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))) [2020-07-28 18:12:43,778 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 22) no Hoare annotation was computed. [2020-07-28 18:12:43,778 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 22) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset)) (.cse1 (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base)) (.cse2 (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base))) (or (and .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset)))) [2020-07-28 18:12:43,779 INFO L268 CegarLoopResult]: For program point L18-4(lines 18 22) no Hoare annotation was computed. [2020-07-28 18:12:43,779 INFO L264 CegarLoopResult]: At program point L37(lines 27 38) the Hoare annotation is: (or (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= (+ ULTIMATE.start_glob2_~p~0.offset 4) ~tmp~0.offset))) [2020-07-28 18:12:43,779 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-28 18:12:43,779 INFO L264 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= ULTIMATE.start_glob2_~pathlim.offset ~tmp~0.offset) (= ULTIMATE.start_glob2_~pathlim.base ~tmp~0.base) (= ~tmp~0.base ULTIMATE.start_glob2_~p~0.base) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) [2020-07-28 18:12:43,784 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:12:43,784 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:12:43,784 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-28 18:12:43,784 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-28 18:12:43,785 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:43,785 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-28 18:12:43,785 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:43,785 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:43,786 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:43,786 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:43,786 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 18:12:43,786 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:43,787 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 18:12:43,787 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:43,787 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:12:43,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:12:43 BoogieIcfgContainer [2020-07-28 18:12:43,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:12:43,826 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:12:43,826 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:12:43,826 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:12:43,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:40" (3/4) ... [2020-07-28 18:12:43,831 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:12:43,844 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-07-28 18:12:43,845 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:12:43,845 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 18:12:43,895 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:12:43,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:12:43,899 INFO L168 Benchmark]: Toolchain (without parser) took 3920.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.2 MB in the beginning and 832.3 MB in the end (delta: 123.9 MB). Peak memory consumption was 258.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:43,900 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:43,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:43,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:43,901 INFO L168 Benchmark]: Boogie Preprocessor took 27.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:43,902 INFO L168 Benchmark]: RCFGBuilder took 401.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:43,903 INFO L168 Benchmark]: TraceAbstraction took 3050.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 839.0 MB in the end (delta: 258.8 MB). Peak memory consumption was 258.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:43,903 INFO L168 Benchmark]: Witness Printer took 70.16 ms. Allocated memory is still 1.2 GB. Free memory was 839.0 MB in the beginning and 832.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:43,907 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 401.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3050.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 839.0 MB in the end (delta: 258.8 MB). Peak memory consumption was 258.8 MB. Max. memory is 11.5 GB. * Witness Printer took 70.16 ms. Allocated memory is still 1.2 GB. Free memory was 839.0 MB in the beginning and 832.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((pathlim <= tmp && pathlim == tmp) && tmp == p) && 1 <= cond) || (((pathlim <= tmp && pathlim == tmp) && tmp == p) && p + 4 <= tmp) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: !(0 == cond) || (tmp == p && p + 4 <= tmp) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((pathlim <= tmp && pathlim == tmp) && tmp == p) && 1 <= cond - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: !(0 == cond) || (tmp == p && p + 4 <= tmp) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 SDtfs, 32 SDslu, 29 SDs, 0 SdLazy, 39 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 13 NumberOfFragments, 70 HoareAnnotationTreeSize, 4 FomulaSimplifications, 114 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 2480 SizeOfPredicates, 26 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 12/20 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 correct! Received shutdown request...