./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.c --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/verifythis/elimination_max_rec.c -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 d4830503b9ef756fb04211cf09b7775ebac5d756 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:13:51,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:13:51,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:13:51,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:13:51,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:13:51,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:13:51,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:13:51,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:13:51,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:13:51,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:13:51,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:13:51,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:13:51,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:13:51,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:13:51,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:13:51,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:13:51,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:13:51,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:13:51,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:13:51,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:13:52,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:13:52,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:13:52,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:13:52,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:13:52,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:13:52,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:13:52,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:13:52,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:13:52,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:13:52,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:13:52,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:13:52,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:13:52,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:13:52,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:13:52,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:13:52,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:13:52,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:13:52,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:13:52,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:13:52,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:13:52,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:13:52,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 19:13:52,046 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:13:52,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:13:52,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:13:52,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:13:52,048 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:13:52,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:13:52,048 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:13:52,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:13:52,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:13:52,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:13:52,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:13:52,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:13:52,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:13:52,049 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:13:52,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:13:52,050 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:13:52,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:13:52,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:13:52,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:13:52,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:13:52,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:13:52,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:13:52,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:13:52,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:13:52,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:13:52,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:13:52,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:13:52,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:13:52,053 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:13:52,053 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 -> d4830503b9ef756fb04211cf09b7775ebac5d756 [2020-07-28 19:13:52,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:13:52,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:13:52,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:13:52,353 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:13:52,354 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:13:52,354 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2020-07-28 19:13:52,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc05e4a3c/f1522bd7713a43e2a42d627eb3c4d83a/FLAGbb0186922 [2020-07-28 19:13:52,904 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:13:52,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2020-07-28 19:13:52,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc05e4a3c/f1522bd7713a43e2a42d627eb3c4d83a/FLAGbb0186922 [2020-07-28 19:13:53,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc05e4a3c/f1522bd7713a43e2a42d627eb3c4d83a [2020-07-28 19:13:53,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:13:53,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:13:53,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:53,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:13:53,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:13:53,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c03627b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53, skipping insertion in model container [2020-07-28 19:13:53,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:13:53,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:13:53,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:53,501 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:13:53,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:53,543 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:13:53,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53 WrapperNode [2020-07-28 19:13:53,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:53,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:53,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:13:53,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:13:53,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:53,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:13:53,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:13:53,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:13:53,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (1/1) ... [2020-07-28 19:13:53,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:13:53,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:13:53,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:13:53,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:13:53,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (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 19:13:53,793 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-28 19:13:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-28 19:13:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 19:13:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:13:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:13:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 19:13:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 19:13:54,268 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:13:54,268 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 19:13:54,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:54 BoogieIcfgContainer [2020-07-28 19:13:54,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:13:54,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:13:54,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:13:54,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:13:54,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:13:53" (1/3) ... [2020-07-28 19:13:54,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4392e758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:54, skipping insertion in model container [2020-07-28 19:13:54,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:53" (2/3) ... [2020-07-28 19:13:54,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4392e758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:54, skipping insertion in model container [2020-07-28 19:13:54,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:54" (3/3) ... [2020-07-28 19:13:54,282 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-07-28 19:13:54,293 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:13:54,301 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-28 19:13:54,315 INFO L251 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-07-28 19:13:54,337 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:13:54,338 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:13:54,338 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:13:54,338 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:13:54,338 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:13:54,338 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:13:54,338 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:13:54,338 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:13:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-28 19:13:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 19:13:54,367 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:54,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:54,368 INFO L427 AbstractCegarLoop]: === Iteration 1 === [checkErr1ASSERT_VIOLATIONERROR_FUNCTION, checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1228012135, now seen corresponding path program 1 times [2020-07-28 19:13:54,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:54,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244328101] [2020-07-28 19:13:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:54,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {30#true} is VALID [2020-07-28 19:13:54,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~ret11, main_~n~0, main_~a~0.base, main_~a~0.offset, main_~x~0;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;assume_abort_if_not_#in~cond := (if main_~n~0 >= 0 && main_~n~0 < 1073741824 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {30#true} is VALID [2020-07-28 19:13:54,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {30#true} assume 0 == assume_abort_if_not_~cond;assume false; {31#false} is VALID [2020-07-28 19:13:54,529 INFO L280 TraceCheckUtils]: 3: Hoare triple {31#false} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4 * main_~n~0);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0, 4, 4 * main_~n~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {31#false} is VALID [2020-07-28 19:13:54,530 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#false} main_~a~0.base, main_~a~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; {31#false} is VALID [2020-07-28 19:13:54,530 INFO L263 TraceCheckUtils]: 5: Hoare triple {31#false} call main_#t~ret11 := check(0, main_~n~0 - 1, main_~a~0.base, main_~a~0.offset, main_~n~0); {31#false} is VALID [2020-07-28 19:13:54,530 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#false} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {31#false} is VALID [2020-07-28 19:13:54,531 INFO L280 TraceCheckUtils]: 7: Hoare triple {31#false} assume !(~x >= ~y);__VERIFIER_assert_#in~cond := (if 0 <= ~x && ~y < ~n then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {31#false} is VALID [2020-07-28 19:13:54,531 INFO L280 TraceCheckUtils]: 8: Hoare triple {31#false} assume 0 == __VERIFIER_assert_~cond; {31#false} is VALID [2020-07-28 19:13:54,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-28 19:13:54,534 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 19:13:54,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244328101] [2020-07-28 19:13:54,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:13:54,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 19:13:54,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965933114] [2020-07-28 19:13:54,543 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 19:13:54,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:54,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 19:13:54,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:54,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 19:13:54,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:54,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 19:13:54,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 19:13:54,584 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2020-07-28 19:13:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:54,665 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2020-07-28 19:13:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 19:13:54,665 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 19:13:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 19:13:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2020-07-28 19:13:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 19:13:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2020-07-28 19:13:54,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2020-07-28 19:13:54,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:54,804 INFO L225 Difference]: With dead ends: 51 [2020-07-28 19:13:54,804 INFO L226 Difference]: Without dead ends: 23 [2020-07-28 19:13:54,813 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 19:13:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-28 19:13:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-28 19:13:54,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:54,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-28 19:13:54,853 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 19:13:54,854 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 19:13:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:54,858 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-28 19:13:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 19:13:54,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:54,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:54,860 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 19:13:54,860 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 19:13:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:54,865 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-28 19:13:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 19:13:54,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:54,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:54,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:54,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 19:13:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-28 19:13:54,871 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2020-07-28 19:13:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:54,872 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-28 19:13:54,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 19:13:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 19:13:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 19:13:54,873 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:54,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:54,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:13:54,874 INFO L427 AbstractCegarLoop]: === Iteration 2 === [checkErr1ASSERT_VIOLATIONERROR_FUNCTION, checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:54,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2037358761, now seen corresponding path program 1 times [2020-07-28 19:13:54,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:54,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700574141] [2020-07-28 19:13:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,019 INFO L280 TraceCheckUtils]: 0: Hoare triple {165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {165#true} is VALID [2020-07-28 19:13:55,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {165#true} havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~ret11, main_~n~0, main_~a~0.base, main_~a~0.offset, main_~x~0;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;assume_abort_if_not_#in~cond := (if main_~n~0 >= 0 && main_~n~0 < 1073741824 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {165#true} is VALID [2020-07-28 19:13:55,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {165#true} assume !(0 == assume_abort_if_not_~cond); {165#true} is VALID [2020-07-28 19:13:55,020 INFO L280 TraceCheckUtils]: 3: Hoare triple {165#true} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4 * main_~n~0);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0, 4, 4 * main_~n~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {165#true} is VALID [2020-07-28 19:13:55,020 INFO L280 TraceCheckUtils]: 4: Hoare triple {165#true} main_~a~0.base, main_~a~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; {165#true} is VALID [2020-07-28 19:13:55,023 INFO L263 TraceCheckUtils]: 5: Hoare triple {165#true} call main_#t~ret11 := check(0, main_~n~0 - 1, main_~a~0.base, main_~a~0.offset, main_~n~0); {167#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-28 19:13:55,024 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {168#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-28 19:13:55,026 INFO L280 TraceCheckUtils]: 7: Hoare triple {168#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y);__VERIFIER_assert_#in~cond := (if 0 <= ~x && ~y < ~n then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {169#(not (= 0 check___VERIFIER_assert_~cond))} is VALID [2020-07-28 19:13:55,027 INFO L280 TraceCheckUtils]: 8: Hoare triple {169#(not (= 0 check___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {166#false} is VALID [2020-07-28 19:13:55,027 INFO L280 TraceCheckUtils]: 9: Hoare triple {166#false} assume !false; {166#false} is VALID [2020-07-28 19:13:55,029 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 19:13:55,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700574141] [2020-07-28 19:13:55,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:13:55,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:13:55,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219487877] [2020-07-28 19:13:55,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 19:13:55,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:55,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:13:55,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:55,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:13:55,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:13:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:13:55,053 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2020-07-28 19:13:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:55,440 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-07-28 19:13:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 19:13:55,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 19:13:55,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:13:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-28 19:13:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:13:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-28 19:13:55,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2020-07-28 19:13:55,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:55,560 INFO L225 Difference]: With dead ends: 54 [2020-07-28 19:13:55,561 INFO L226 Difference]: Without dead ends: 52 [2020-07-28 19:13:55,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 19:13:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-28 19:13:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2020-07-28 19:13:55,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:55,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 37 states. [2020-07-28 19:13:55,585 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 37 states. [2020-07-28 19:13:55,585 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 37 states. [2020-07-28 19:13:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:55,592 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-28 19:13:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-28 19:13:55,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:55,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:55,595 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 52 states. [2020-07-28 19:13:55,595 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 52 states. [2020-07-28 19:13:55,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:55,602 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-28 19:13:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-28 19:13:55,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:55,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:55,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:55,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-28 19:13:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2020-07-28 19:13:55,608 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 10 [2020-07-28 19:13:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:55,609 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-07-28 19:13:55,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:13:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-28 19:13:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 19:13:55,610 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:55,610 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:55,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 19:13:55,611 INFO L427 AbstractCegarLoop]: === Iteration 3 === [checkErr1ASSERT_VIOLATIONERROR_FUNCTION, checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:55,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1470600778, now seen corresponding path program 1 times [2020-07-28 19:13:55,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:55,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595169183] [2020-07-28 19:13:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {385#true} is VALID [2020-07-28 19:13:55,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {385#true} havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~ret11, main_~n~0, main_~a~0.base, main_~a~0.offset, main_~x~0;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;assume_abort_if_not_#in~cond := (if main_~n~0 >= 0 && main_~n~0 < 1073741824 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {385#true} is VALID [2020-07-28 19:13:55,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {385#true} assume !(0 == assume_abort_if_not_~cond); {385#true} is VALID [2020-07-28 19:13:55,841 INFO L280 TraceCheckUtils]: 3: Hoare triple {385#true} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4 * main_~n~0);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0, 4, 4 * main_~n~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {385#true} is VALID [2020-07-28 19:13:55,842 INFO L280 TraceCheckUtils]: 4: Hoare triple {385#true} main_~a~0.base, main_~a~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; {385#true} is VALID [2020-07-28 19:13:55,844 INFO L263 TraceCheckUtils]: 5: Hoare triple {385#true} call main_#t~ret11 := check(0, main_~n~0 - 1, main_~a~0.base, main_~a~0.offset, main_~n~0); {387#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-28 19:13:55,845 INFO L280 TraceCheckUtils]: 6: Hoare triple {387#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {388#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-28 19:13:55,846 INFO L280 TraceCheckUtils]: 7: Hoare triple {388#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y);__VERIFIER_assert_#in~cond := (if 0 <= ~x && ~y < ~n then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {388#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-28 19:13:55,848 INFO L280 TraceCheckUtils]: 8: Hoare triple {388#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(0 == __VERIFIER_assert_~cond); {388#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-28 19:13:55,851 INFO L280 TraceCheckUtils]: 9: Hoare triple {388#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x;~y0~0 := ~y;call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4);call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); {388#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-28 19:13:55,852 INFO L280 TraceCheckUtils]: 10: Hoare triple {388#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2;havoc #t~mem2;havoc #t~mem1;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {389#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-28 19:13:55,855 INFO L263 TraceCheckUtils]: 11: Hoare triple {389#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {390#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-28 19:13:55,857 INFO L280 TraceCheckUtils]: 12: Hoare triple {390#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {389#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-28 19:13:55,858 INFO L280 TraceCheckUtils]: 13: Hoare triple {389#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y);__VERIFIER_assert_#in~cond := (if 0 <= ~x && ~y < ~n then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {391#(not (= 0 check___VERIFIER_assert_~cond))} is VALID [2020-07-28 19:13:55,859 INFO L280 TraceCheckUtils]: 14: Hoare triple {391#(not (= 0 check___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {386#false} is VALID [2020-07-28 19:13:55,860 INFO L280 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2020-07-28 19:13:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:13:55,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595169183] [2020-07-28 19:13:55,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424920391] [2020-07-28 19:13:55,867 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 19:13:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-28 19:13:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:13:56,468 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 19:13:56,501 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 19:13:56,552 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 19:13:56,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {385#true} is VALID [2020-07-28 19:13:56,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {385#true} havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~ret11, main_~n~0, main_~a~0.base, main_~a~0.offset, main_~x~0;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;assume_abort_if_not_#in~cond := (if main_~n~0 >= 0 && main_~n~0 < 1073741824 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {385#true} is VALID [2020-07-28 19:13:56,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {385#true} assume !(0 == assume_abort_if_not_~cond); {385#true} is VALID [2020-07-28 19:13:56,702 INFO L280 TraceCheckUtils]: 3: Hoare triple {385#true} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4 * main_~n~0);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0, 4, 4 * main_~n~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {385#true} is VALID [2020-07-28 19:13:56,703 INFO L280 TraceCheckUtils]: 4: Hoare triple {385#true} main_~a~0.base, main_~a~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; {385#true} is VALID [2020-07-28 19:13:56,705 INFO L263 TraceCheckUtils]: 5: Hoare triple {385#true} call main_#t~ret11 := check(0, main_~n~0 - 1, main_~a~0.base, main_~a~0.offset, main_~n~0); {410#(and (<= 0 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-28 19:13:56,707 INFO L280 TraceCheckUtils]: 6: Hoare triple {410#(and (<= 0 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {414#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-28 19:13:56,709 INFO L280 TraceCheckUtils]: 7: Hoare triple {414#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y);__VERIFIER_assert_#in~cond := (if 0 <= ~x && ~y < ~n then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {414#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-28 19:13:56,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {414#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(0 == __VERIFIER_assert_~cond); {414#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-28 19:13:56,713 INFO L280 TraceCheckUtils]: 9: Hoare triple {414#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x;~y0~0 := ~y;call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4);call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); {414#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-28 19:13:56,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {414#(and (<= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2;havoc #t~mem2;havoc #t~mem1;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {389#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-28 19:13:56,717 INFO L263 TraceCheckUtils]: 11: Hoare triple {389#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {390#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-28 19:13:56,718 INFO L280 TraceCheckUtils]: 12: Hoare triple {390#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {389#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-28 19:13:56,720 INFO L280 TraceCheckUtils]: 13: Hoare triple {389#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y);__VERIFIER_assert_#in~cond := (if 0 <= ~x && ~y < ~n then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {436#(<= 1 check___VERIFIER_assert_~cond)} is VALID [2020-07-28 19:13:56,721 INFO L280 TraceCheckUtils]: 14: Hoare triple {436#(<= 1 check___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {386#false} is VALID [2020-07-28 19:13:56,721 INFO L280 TraceCheckUtils]: 15: Hoare triple {386#false} assume !false; {386#false} is VALID [2020-07-28 19:13:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:13:56,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:13:56,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-28 19:13:56,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973126471] [2020-07-28 19:13:56,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-07-28 19:13:56,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:56,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 19:13:56,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:56,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 19:13:56,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:56,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 19:13:56,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:13:56,789 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 10 states. [2020-07-28 19:13:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:57,674 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-28 19:13:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-28 19:13:57,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-07-28 19:13:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:13:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2020-07-28 19:13:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:13:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2020-07-28 19:13:57,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2020-07-28 19:13:57,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:57,796 INFO L225 Difference]: With dead ends: 52 [2020-07-28 19:13:57,801 INFO L226 Difference]: Without dead ends: 50 [2020-07-28 19:13:57,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2020-07-28 19:13:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-28 19:13:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 21. [2020-07-28 19:13:57,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:57,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 21 states. [2020-07-28 19:13:57,817 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 21 states. [2020-07-28 19:13:57,817 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 21 states. [2020-07-28 19:13:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:57,824 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-28 19:13:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2020-07-28 19:13:57,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:57,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:57,827 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 50 states. [2020-07-28 19:13:57,827 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 50 states. [2020-07-28 19:13:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:57,835 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-28 19:13:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2020-07-28 19:13:57,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:57,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:57,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:57,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 19:13:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-28 19:13:57,841 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2020-07-28 19:13:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:57,841 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-28 19:13:57,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 19:13:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-28 19:13:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 19:13:57,846 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:57,846 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:58,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 19:13:58,061 INFO L427 AbstractCegarLoop]: === Iteration 4 === [checkErr1ASSERT_VIOLATIONERROR_FUNCTION, checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1849931057, now seen corresponding path program 1 times [2020-07-28 19:13:58,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:58,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112849938] [2020-07-28 19:13:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:58,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-07-28 19:13:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:58,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {642#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {642#true} is VALID [2020-07-28 19:13:58,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#true} assume ~x >= ~y;#res := ~x; {642#true} is VALID [2020-07-28 19:13:58,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {642#true} assume true; {642#true} is VALID [2020-07-28 19:13:58,262 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {642#true} {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #59#return; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:13:58,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {642#true} is VALID [2020-07-28 19:13:58,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#true} havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~ret11, main_~n~0, main_~a~0.base, main_~a~0.offset, main_~x~0;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;assume_abort_if_not_#in~cond := (if main_~n~0 >= 0 && main_~n~0 < 1073741824 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {642#true} is VALID [2020-07-28 19:13:58,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {642#true} assume !(0 == assume_abort_if_not_~cond); {642#true} is VALID [2020-07-28 19:13:58,265 INFO L280 TraceCheckUtils]: 3: Hoare triple {642#true} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4 * main_~n~0);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0, 4, 4 * main_~n~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {644#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc10.base|))} is VALID [2020-07-28 19:13:58,266 INFO L280 TraceCheckUtils]: 4: Hoare triple {644#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc10.base|))} main_~a~0.base, main_~a~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; {645#(= ((as const (Array Int Int)) 0) (select |#memory_int| ULTIMATE.start_main_~a~0.base))} is VALID [2020-07-28 19:13:58,268 INFO L263 TraceCheckUtils]: 5: Hoare triple {645#(= ((as const (Array Int Int)) 0) (select |#memory_int| ULTIMATE.start_main_~a~0.base))} call main_#t~ret11 := check(0, main_~n~0 - 1, main_~a~0.base, main_~a~0.offset, main_~n~0); {646#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-28 19:13:58,269 INFO L280 TraceCheckUtils]: 6: Hoare triple {646#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:13:58,270 INFO L280 TraceCheckUtils]: 7: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y);__VERIFIER_assert_#in~cond := (if 0 <= ~x && ~y < ~n then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:13:58,271 INFO L280 TraceCheckUtils]: 8: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(0 == __VERIFIER_assert_~cond); {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:13:58,272 INFO L280 TraceCheckUtils]: 9: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x;~y0~0 := ~y;call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4);call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:13:58,272 INFO L280 TraceCheckUtils]: 10: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2;havoc #t~mem2;havoc #t~mem1;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:13:58,273 INFO L263 TraceCheckUtils]: 11: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {642#true} is VALID [2020-07-28 19:13:58,273 INFO L280 TraceCheckUtils]: 12: Hoare triple {642#true} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {642#true} is VALID [2020-07-28 19:13:58,274 INFO L280 TraceCheckUtils]: 13: Hoare triple {642#true} assume ~x >= ~y;#res := ~x; {642#true} is VALID [2020-07-28 19:13:58,274 INFO L280 TraceCheckUtils]: 14: Hoare triple {642#true} assume true; {642#true} is VALID [2020-07-28 19:13:58,276 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {642#true} {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #59#return; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:13:58,277 INFO L280 TraceCheckUtils]: 16: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~x1~0 := #t~ret5;havoc #t~ret5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~i~0 := #t~nondet6;havoc #t~nondet6;assume_abort_if_not_#in~cond := (if ~x0~0 <= ~i~0 && ~i~0 <= ~y0~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:13:58,278 INFO L280 TraceCheckUtils]: 17: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(0 == assume_abort_if_not_~cond); {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:13:58,279 INFO L280 TraceCheckUtils]: 18: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4);~ai~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4);~ax~0 := #t~mem8;havoc #t~mem8;__VERIFIER_assert_#in~cond := (if ~ai~0 <= ~ax~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {652#(not (= 0 check___VERIFIER_assert_~cond))} is VALID [2020-07-28 19:13:58,280 INFO L280 TraceCheckUtils]: 19: Hoare triple {652#(not (= 0 check___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {643#false} is VALID [2020-07-28 19:13:58,281 INFO L280 TraceCheckUtils]: 20: Hoare triple {643#false} assume !false; {643#false} is VALID [2020-07-28 19:13:58,283 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 19:13:58,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112849938] [2020-07-28 19:13:58,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085557172] [2020-07-28 19:13:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 19:13:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:58,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-28 19:13:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:58,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:13:58,412 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2020-07-28 19:13:58,413 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 19:13:58,416 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 19:13:58,417 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 19:13:58,417 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2020-07-28 19:13:58,420 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 19:13:58,420 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_5|]. (= (store |v_#memory_int_5| |ULTIMATE.start_main_#t~malloc10.base| ((as const (Array Int Int)) 0)) |#memory_int|) [2020-07-28 19:13:58,421 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc10.base|)) [2020-07-28 19:14:00,471 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_1))) is different from true [2020-07-28 19:14:00,674 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 19:14:00,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {642#true} is VALID [2020-07-28 19:14:00,848 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#true} havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~ret11, main_~n~0, main_~a~0.base, main_~a~0.offset, main_~x~0;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;assume_abort_if_not_#in~cond := (if main_~n~0 >= 0 && main_~n~0 < 1073741824 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {642#true} is VALID [2020-07-28 19:14:00,848 INFO L280 TraceCheckUtils]: 2: Hoare triple {642#true} assume !(0 == assume_abort_if_not_~cond); {642#true} is VALID [2020-07-28 19:14:00,850 INFO L280 TraceCheckUtils]: 3: Hoare triple {642#true} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4 * main_~n~0);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0, 4, 4 * main_~n~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {644#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc10.base|))} is VALID [2020-07-28 19:14:00,851 INFO L280 TraceCheckUtils]: 4: Hoare triple {644#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc10.base|))} main_~a~0.base, main_~a~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; {645#(= ((as const (Array Int Int)) 0) (select |#memory_int| ULTIMATE.start_main_~a~0.base))} is VALID [2020-07-28 19:14:00,852 INFO L263 TraceCheckUtils]: 5: Hoare triple {645#(= ((as const (Array Int Int)) 0) (select |#memory_int| ULTIMATE.start_main_~a~0.base))} call main_#t~ret11 := check(0, main_~n~0 - 1, main_~a~0.base, main_~a~0.offset, main_~n~0); {646#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-28 19:14:00,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {646#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:14:00,854 INFO L280 TraceCheckUtils]: 7: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y);__VERIFIER_assert_#in~cond := (if 0 <= ~x && ~y < ~n then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:14:00,854 INFO L280 TraceCheckUtils]: 8: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(0 == __VERIFIER_assert_~cond); {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:14:00,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x;~y0~0 := ~y;call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4);call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:14:00,856 INFO L280 TraceCheckUtils]: 10: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2;havoc #t~mem2;havoc #t~mem1;#t~post3 := ~x;~x := 1 + #t~post3;havoc #t~post3; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:14:00,858 INFO L263 TraceCheckUtils]: 11: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {689#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} is VALID [2020-07-28 19:14:00,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {689#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} ~x := #in~x;~y := #in~y;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; {689#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} is VALID [2020-07-28 19:14:00,860 INFO L280 TraceCheckUtils]: 13: Hoare triple {689#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} assume ~x >= ~y;#res := ~x; {689#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} is VALID [2020-07-28 19:14:00,860 INFO L280 TraceCheckUtils]: 14: Hoare triple {689#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} assume true; {689#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} is VALID [2020-07-28 19:14:00,861 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {689#(exists ((v_check_~a.base_BEFORE_CALL_1 Int)) (= ((as const (Array Int Int)) 0) (select |#memory_int| v_check_~a.base_BEFORE_CALL_1)))} {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #59#return; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:14:00,862 INFO L280 TraceCheckUtils]: 16: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~x1~0 := #t~ret5;havoc #t~ret5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~i~0 := #t~nondet6;havoc #t~nondet6;assume_abort_if_not_#in~cond := (if ~x0~0 <= ~i~0 && ~i~0 <= ~y0~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:14:00,863 INFO L280 TraceCheckUtils]: 17: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(0 == assume_abort_if_not_~cond); {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-28 19:14:00,864 INFO L280 TraceCheckUtils]: 18: Hoare triple {647#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4);~ai~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4);~ax~0 := #t~mem8;havoc #t~mem8;__VERIFIER_assert_#in~cond := (if ~ai~0 <= ~ax~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {711#(<= 1 check___VERIFIER_assert_~cond)} is VALID [2020-07-28 19:14:00,864 INFO L280 TraceCheckUtils]: 19: Hoare triple {711#(<= 1 check___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {643#false} is VALID [2020-07-28 19:14:00,865 INFO L280 TraceCheckUtils]: 20: Hoare triple {643#false} assume !false; {643#false} is VALID [2020-07-28 19:14:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-07-28 19:14:00,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:14:00,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2020-07-28 19:14:00,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734388473] [2020-07-28 19:14:00,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-28 19:14:00,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:14:00,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 19:14:00,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:00,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 19:14:00,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:14:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 19:14:00,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2020-07-28 19:14:00,918 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 9 states. [2020-07-28 19:14:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:07,316 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-28 19:14:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:14:07,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-28 19:14:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:14:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:14:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-28 19:14:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:14:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-28 19:14:07,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2020-07-28 19:14:07,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:07,365 INFO L225 Difference]: With dead ends: 23 [2020-07-28 19:14:07,365 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 19:14:07,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=38, Invalid=97, Unknown=1, NotChecked=20, Total=156 [2020-07-28 19:14:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 19:14:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 19:14:07,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:14:07,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 19:14:07,368 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:14:07,368 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:14:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:07,369 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:14:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:14:07,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:07,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:07,369 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:14:07,370 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:14:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:07,370 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:14:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:14:07,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:07,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:07,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:14:07,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:14:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 19:14:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 19:14:07,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-28 19:14:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:14:07,372 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 19:14:07,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 19:14:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:14:07,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:07,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:14:07,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 19:14:07,812 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-07-28 19:14:07,819 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 19:14:07,819 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 19:14:07,819 INFO L268 CegarLoopResult]: For program point L-1-1(line -1) no Hoare annotation was computed. [2020-07-28 19:14:07,819 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 19:14:07,819 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 19:14:07,820 INFO L271 CegarLoopResult]: At program point L47(lines 39 48) the Hoare annotation is: true [2020-07-28 19:14:07,820 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_#t~malloc10.base|)))) [2020-07-28 19:14:07,820 INFO L268 CegarLoopResult]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-07-28 19:14:07,820 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-28 19:14:07,820 INFO L268 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2020-07-28 19:14:07,821 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 37) the Hoare annotation is: true [2020-07-28 19:14:07,821 INFO L268 CegarLoopResult]: For program point checkErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-28 19:14:07,821 INFO L268 CegarLoopResult]: For program point L23(lines 23 24) no Hoare annotation was computed. [2020-07-28 19:14:07,821 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 24) the Hoare annotation is: (let ((.cse1 (= 0 |check_#in~x|)) (.cse4 ((as const (Array Int Int)) 0))) (or (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|)))) (and (or (not (<= 1 |check_#in~x|)) .cse0) (or .cse0 (not .cse1)))) (and (let ((.cse2 (<= (+ check_~y 1) check_~n)) (.cse3 (<= 1 check___VERIFIER_assert_~cond))) (or (and (= 0 check_~x) .cse2 .cse1 .cse3) (and .cse2 (<= 1 check_~x) .cse3))) (= .cse4 (select |#memory_int| check_~a.base))) (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) [2020-07-28 19:14:07,821 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-28 19:14:07,821 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-28 19:14:07,822 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-28 19:14:07,822 INFO L268 CegarLoopResult]: For program point checkFINAL(lines 14 37) no Hoare annotation was computed. [2020-07-28 19:14:07,822 INFO L268 CegarLoopResult]: For program point L9-3(line 9) no Hoare annotation was computed. [2020-07-28 19:14:07,823 INFO L268 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2020-07-28 19:14:07,823 INFO L268 CegarLoopResult]: For program point L9-4(line 9) no Hoare annotation was computed. [2020-07-28 19:14:07,823 INFO L268 CegarLoopResult]: For program point checkErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-28 19:14:07,824 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-28 19:14:07,824 INFO L268 CegarLoopResult]: For program point checkEXIT(lines 14 37) no Hoare annotation was computed. [2020-07-28 19:14:07,824 INFO L268 CegarLoopResult]: For program point L8(lines 8 10) no Hoare annotation was computed. [2020-07-28 19:14:07,824 INFO L268 CegarLoopResult]: For program point L8-1(lines 8 10) no Hoare annotation was computed. [2020-07-28 19:14:07,824 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-28 19:14:07,830 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 19:14:07,830 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-28 19:14:07,830 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 19:14:07,830 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-28 19:14:07,830 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-28 19:14:07,831 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 19:14:07,831 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 19:14:07,831 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-28 19:14:07,831 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 19:14:07,831 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 19:14:07,831 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 19:14:07,831 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-28 19:14:07,832 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-28 19:14:07,832 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-28 19:14:07,832 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-28 19:14:07,832 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 19:14:07,832 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-28 19:14:07,832 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-28 19:14:07,832 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 19:14:07,833 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 19:14:07,833 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 19:14:07,833 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-28 19:14:07,833 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:14:07,833 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 19:14:07,833 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 19:14:07,833 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 19:14:07,834 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:14:07,834 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 19:14:07,835 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-28 19:14:07,835 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-28 19:14:07,835 WARN L170 areAnnotationChecker]: L9-4 has no Hoare annotation [2020-07-28 19:14:07,835 WARN L170 areAnnotationChecker]: L9-4 has no Hoare annotation [2020-07-28 19:14:07,835 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-28 19:14:07,835 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 19:14:07,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 07:14:07 BoogieIcfgContainer [2020-07-28 19:14:07,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 19:14:07,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 19:14:07,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 19:14:07,847 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 19:14:07,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:54" (3/4) ... [2020-07-28 19:14:07,852 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 19:14:07,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2020-07-28 19:14:07,871 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2020-07-28 19:14:07,872 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 19:14:07,872 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 19:14:07,934 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 19:14:07,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 19:14:07,937 INFO L168 Benchmark]: Toolchain (without parser) took 14675.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 954.9 MB in the beginning and 848.3 MB in the end (delta: 106.6 MB). Peak memory consumption was 324.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:07,938 INFO L168 Benchmark]: CDTParser took 0.28 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 19:14:07,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.27 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 942.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:07,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:07,940 INFO L168 Benchmark]: Boogie Preprocessor took 63.56 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 19:14:07,940 INFO L168 Benchmark]: RCFGBuilder took 556.69 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: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:07,941 INFO L168 Benchmark]: TraceAbstraction took 13572.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 855.7 MB in the end (delta: 248.5 MB). Peak memory consumption was 315.0 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:07,942 INFO L168 Benchmark]: Witness Printer took 87.81 ms. Allocated memory is still 1.2 GB. Free memory was 855.7 MB in the beginning and 848.3 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:07,945 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.28 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 279.27 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 942.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.56 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 556.69 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: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13572.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 855.7 MB in the end (delta: 248.5 MB). Peak memory consumption was 315.0 MB. Max. memory is 11.5 GB. * Witness Printer took 87.81 ms. Allocated memory is still 1.2 GB. Free memory was 855.7 MB in the beginning and 848.3 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.2s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 144 SDslu, 217 SDs, 0 SdLazy, 179 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 44 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 81 HoareAnnotationTreeSize, 10 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 107 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 88 ConstructedInterpolants, 4 QuantifiedInterpolants, 6358 SizeOfPredicates, 23 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2/10 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...