./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/McCarthy91-2.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/recursive/McCarthy91-2.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 edcc597a46f9ad79563531282ca675b8b1d7c4bf ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:08:10,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:08:10,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:08:10,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:08:10,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:08:10,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:08:10,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:08:10,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:08:10,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:08:10,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:08:10,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:08:10,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:08:10,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:08:10,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:08:10,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:08:10,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:08:10,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:08:10,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:08:10,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:08:10,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:08:10,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:08:10,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:08:10,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:08:10,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:08:10,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:08:10,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:08:10,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:08:10,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:08:10,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:08:10,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:08:10,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:08:10,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:08:10,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:08:10,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:08:10,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:08:10,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:08:10,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:08:10,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:08:10,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:08:10,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:08:10,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:08:10,099 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:08:10,114 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:08:10,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:08:10,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:08:10,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:08:10,116 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:08:10,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:08:10,116 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:08:10,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:08:10,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:08:10,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:08:10,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:08:10,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:08:10,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:08:10,118 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:08:10,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:08:10,119 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:08:10,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:08:10,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:08:10,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:08:10,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:08:10,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:08:10,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:08:10,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:08:10,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:08:10,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:08:10,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:08:10,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:08:10,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:08:10,123 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:08:10,123 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 -> edcc597a46f9ad79563531282ca675b8b1d7c4bf [2020-07-28 19:08:10,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:08:10,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:08:10,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:08:10,428 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:08:10,428 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:08:10,429 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/McCarthy91-2.c [2020-07-28 19:08:10,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6b1a070/ffd94177b941453ab75781650609a6af/FLAG941715ca8 [2020-07-28 19:08:10,832 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:08:10,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c [2020-07-28 19:08:10,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6b1a070/ffd94177b941453ab75781650609a6af/FLAG941715ca8 [2020-07-28 19:08:11,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6b1a070/ffd94177b941453ab75781650609a6af [2020-07-28 19:08:11,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:08:11,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:08:11,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:08:11,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:08:11,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:08:11,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:08:11" (1/1) ... [2020-07-28 19:08:11,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403835b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11, skipping insertion in model container [2020-07-28 19:08:11,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:08:11" (1/1) ... [2020-07-28 19:08:11,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:08:11,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:08:11,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:08:11,452 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:08:11,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:08:11,482 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:08:11,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11 WrapperNode [2020-07-28 19:08:11,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:08:11,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:08:11,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:08:11,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:08:11,493 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:08:11" (1/1) ... [2020-07-28 19:08:11,499 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:08:11" (1/1) ... [2020-07-28 19:08:11,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:08:11,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:08:11,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:08:11,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:08:11,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11" (1/1) ... [2020-07-28 19:08:11,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11" (1/1) ... [2020-07-28 19:08:11,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11" (1/1) ... [2020-07-28 19:08:11,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11" (1/1) ... [2020-07-28 19:08:11,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11" (1/1) ... [2020-07-28 19:08:11,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11" (1/1) ... [2020-07-28 19:08:11,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11" (1/1) ... [2020-07-28 19:08:11,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:08:11,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:08:11,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:08:11,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:08:11,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11" (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:08:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:08:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:08:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2020-07-28 19:08:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2020-07-28 19:08:11,970 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:08:11,970 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:08:11,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:08:11 BoogieIcfgContainer [2020-07-28 19:08:11,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:08:11,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:08:11,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:08:11,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:08:11,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:08:11" (1/3) ... [2020-07-28 19:08:11,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dfc687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:08:11, skipping insertion in model container [2020-07-28 19:08:11,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:08:11" (2/3) ... [2020-07-28 19:08:11,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dfc687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:08:11, skipping insertion in model container [2020-07-28 19:08:11,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:08:11" (3/3) ... [2020-07-28 19:08:11,982 INFO L109 eAbstractionObserver]: Analyzing ICFG McCarthy91-2.c [2020-07-28 19:08:11,992 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:08:12,000 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:08:12,013 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:08:12,034 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:08:12,035 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:08:12,035 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:08:12,035 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:08:12,035 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:08:12,035 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:08:12,035 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:08:12,036 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:08:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-07-28 19:08:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 19:08:12,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:08:12,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:08:12,060 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:08:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:08:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash -417462297, now seen corresponding path program 1 times [2020-07-28 19:08:12,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:08:12,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26263087] [2020-07-28 19:08:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:08:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:08:12,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:08:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:08:12,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#true} ~x := #in~x; {28#(= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:12,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {29#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-28 19:08:12,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} assume true; {29#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-28 19:08:12,451 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {29#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} {20#true} #26#return; {26#(and (<= 91 |ULTIMATE.start_main_#t~ret3|) (<= (+ |ULTIMATE.start_main_#t~ret3| 10) ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 (+ |ULTIMATE.start_main_#t~ret3| 10)))} is VALID [2020-07-28 19:08:12,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {20#true} is VALID [2020-07-28 19:08:12,454 INFO L263 TraceCheckUtils]: 1: Hoare triple {20#true} call main_#t~ret3 := f91(main_~x~0); {20#true} is VALID [2020-07-28 19:08:12,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {20#true} ~x := #in~x; {28#(= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:12,456 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {29#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-28 19:08:12,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} assume true; {29#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-28 19:08:12,460 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {29#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} {20#true} #26#return; {26#(and (<= 91 |ULTIMATE.start_main_#t~ret3|) (<= (+ |ULTIMATE.start_main_#t~ret3| 10) ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 (+ |ULTIMATE.start_main_#t~ret3| 10)))} is VALID [2020-07-28 19:08:12,461 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#(and (<= 91 |ULTIMATE.start_main_#t~ret3|) (<= (+ |ULTIMATE.start_main_#t~ret3| 10) ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 (+ |ULTIMATE.start_main_#t~ret3| 10)))} assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647;main_~result~0 := main_#t~ret3;havoc main_#t~ret3; {27#(and (< 90 ULTIMATE.start_main_~result~0) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~result~0 10)) (< (+ ULTIMATE.start_main_~result~0 9) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 19:08:12,463 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#(and (< 90 ULTIMATE.start_main_~result~0) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~result~0 10)) (< (+ ULTIMATE.start_main_~result~0 9) ULTIMATE.start_main_~x~0))} assume !(91 == main_~result~0 || (main_~x~0 > 101 && main_~result~0 == main_~x~0 - 10)); {21#false} is VALID [2020-07-28 19:08:12,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {21#false} assume !false; {21#false} is VALID [2020-07-28 19:08:12,465 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:08:12,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26263087] [2020-07-28 19:08:12,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:08:12,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-28 19:08:12,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623316353] [2020-07-28 19:08:12,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-28 19:08:12,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:08:12,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 19:08:12,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:08:12,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 19:08:12,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:08:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 19:08:12,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-28 19:08:12,515 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2020-07-28 19:08:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:08:12,790 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-28 19:08:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 19:08:12,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-28 19:08:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:08:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 19:08:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2020-07-28 19:08:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 19:08:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2020-07-28 19:08:12,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2020-07-28 19:08:12,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:08:12,874 INFO L225 Difference]: With dead ends: 29 [2020-07-28 19:08:12,874 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 19:08:12,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:08:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 19:08:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 19:08:12,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:08:12,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 19:08:12,922 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 19:08:12,922 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 19:08:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:08:12,928 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-28 19:08:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-28 19:08:12,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:08:12,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:08:12,930 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 19:08:12,930 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 19:08:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:08:12,935 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-28 19:08:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-28 19:08:12,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:08:12,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:08:12,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:08:12,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:08:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 19:08:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-07-28 19:08:12,943 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2020-07-28 19:08:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:08:12,943 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-28 19:08:12,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 19:08:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-28 19:08:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 19:08:12,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:08:12,946 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:08:12,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:08:12,946 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:08:12,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:08:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2030866466, now seen corresponding path program 1 times [2020-07-28 19:08:12,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:08:12,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094269439] [2020-07-28 19:08:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:08:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:08:13,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:08:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:08:13,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:08:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:08:13,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#true} ~x := #in~x; {154#(= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:13,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {154#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-28 19:08:13,222 INFO L280 TraceCheckUtils]: 2: Hoare triple {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-28 19:08:13,224 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} {142#(<= f91_~x 100)} #28#return; {147#(<= |f91_#t~ret0| 101)} is VALID [2020-07-28 19:08:13,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-28 19:08:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:08:13,268 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#true} ~x := #in~x; {154#(= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:13,269 INFO L280 TraceCheckUtils]: 1: Hoare triple {154#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-28 19:08:13,270 INFO L280 TraceCheckUtils]: 2: Hoare triple {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-28 19:08:13,272 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {147#(<= |f91_#t~ret0| 101)} #30#return; {152#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-28 19:08:13,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#true} ~x := #in~x; {122#true} is VALID [2020-07-28 19:08:13,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {122#true} assume !(~x > 100); {142#(<= f91_~x 100)} is VALID [2020-07-28 19:08:13,274 INFO L263 TraceCheckUtils]: 2: Hoare triple {142#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {122#true} is VALID [2020-07-28 19:08:13,276 INFO L280 TraceCheckUtils]: 3: Hoare triple {122#true} ~x := #in~x; {154#(= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:13,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {154#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-28 19:08:13,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-28 19:08:13,281 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} {142#(<= f91_~x 100)} #28#return; {147#(<= |f91_#t~ret0| 101)} is VALID [2020-07-28 19:08:13,282 INFO L280 TraceCheckUtils]: 7: Hoare triple {147#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {147#(<= |f91_#t~ret0| 101)} is VALID [2020-07-28 19:08:13,282 INFO L263 TraceCheckUtils]: 8: Hoare triple {147#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {122#true} is VALID [2020-07-28 19:08:13,283 INFO L280 TraceCheckUtils]: 9: Hoare triple {122#true} ~x := #in~x; {154#(= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:13,284 INFO L280 TraceCheckUtils]: 10: Hoare triple {154#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-28 19:08:13,285 INFO L280 TraceCheckUtils]: 11: Hoare triple {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-28 19:08:13,288 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {147#(<= |f91_#t~ret0| 101)} #30#return; {152#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-28 19:08:13,289 INFO L280 TraceCheckUtils]: 13: Hoare triple {152#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-28 19:08:13,290 INFO L280 TraceCheckUtils]: 14: Hoare triple {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-28 19:08:13,292 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {122#true} #26#return; {140#(and (<= |ULTIMATE.start_main_#t~ret3| 91) (<= 91 |ULTIMATE.start_main_#t~ret3|))} is VALID [2020-07-28 19:08:13,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {122#true} is VALID [2020-07-28 19:08:13,294 INFO L263 TraceCheckUtils]: 1: Hoare triple {122#true} call main_#t~ret3 := f91(main_~x~0); {122#true} is VALID [2020-07-28 19:08:13,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {122#true} ~x := #in~x; {122#true} is VALID [2020-07-28 19:08:13,296 INFO L280 TraceCheckUtils]: 3: Hoare triple {122#true} assume !(~x > 100); {142#(<= f91_~x 100)} is VALID [2020-07-28 19:08:13,297 INFO L263 TraceCheckUtils]: 4: Hoare triple {142#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {122#true} is VALID [2020-07-28 19:08:13,298 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#true} ~x := #in~x; {154#(= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:13,299 INFO L280 TraceCheckUtils]: 6: Hoare triple {154#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-28 19:08:13,300 INFO L280 TraceCheckUtils]: 7: Hoare triple {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-28 19:08:13,302 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} {142#(<= f91_~x 100)} #28#return; {147#(<= |f91_#t~ret0| 101)} is VALID [2020-07-28 19:08:13,303 INFO L280 TraceCheckUtils]: 9: Hoare triple {147#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {147#(<= |f91_#t~ret0| 101)} is VALID [2020-07-28 19:08:13,304 INFO L263 TraceCheckUtils]: 10: Hoare triple {147#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {122#true} is VALID [2020-07-28 19:08:13,306 INFO L280 TraceCheckUtils]: 11: Hoare triple {122#true} ~x := #in~x; {154#(= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:13,307 INFO L280 TraceCheckUtils]: 12: Hoare triple {154#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-28 19:08:13,309 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-28 19:08:13,311 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {147#(<= |f91_#t~ret0| 101)} #30#return; {152#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-28 19:08:13,312 INFO L280 TraceCheckUtils]: 15: Hoare triple {152#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-28 19:08:13,313 INFO L280 TraceCheckUtils]: 16: Hoare triple {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-28 19:08:13,315 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {122#true} #26#return; {140#(and (<= |ULTIMATE.start_main_#t~ret3| 91) (<= 91 |ULTIMATE.start_main_#t~ret3|))} is VALID [2020-07-28 19:08:13,316 INFO L280 TraceCheckUtils]: 18: Hoare triple {140#(and (<= |ULTIMATE.start_main_#t~ret3| 91) (<= 91 |ULTIMATE.start_main_#t~ret3|))} assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647;main_~result~0 := main_#t~ret3;havoc main_#t~ret3; {141#(and (< 90 ULTIMATE.start_main_~result~0) (<= ULTIMATE.start_main_~result~0 91))} is VALID [2020-07-28 19:08:13,317 INFO L280 TraceCheckUtils]: 19: Hoare triple {141#(and (< 90 ULTIMATE.start_main_~result~0) (<= ULTIMATE.start_main_~result~0 91))} assume !(91 == main_~result~0 || (main_~x~0 > 101 && main_~result~0 == main_~x~0 - 10)); {123#false} is VALID [2020-07-28 19:08:13,318 INFO L280 TraceCheckUtils]: 20: Hoare triple {123#false} assume !false; {123#false} is VALID [2020-07-28 19:08:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 19:08:13,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094269439] [2020-07-28 19:08:13,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481875992] [2020-07-28 19:08:13,323 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:08:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:08:13,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-28 19:08:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:08:13,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:08:13,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {122#true} is VALID [2020-07-28 19:08:13,780 INFO L263 TraceCheckUtils]: 1: Hoare triple {122#true} call main_#t~ret3 := f91(main_~x~0); {122#true} is VALID [2020-07-28 19:08:13,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {122#true} ~x := #in~x; {122#true} is VALID [2020-07-28 19:08:13,782 INFO L280 TraceCheckUtils]: 3: Hoare triple {122#true} assume !(~x > 100); {142#(<= f91_~x 100)} is VALID [2020-07-28 19:08:13,782 INFO L263 TraceCheckUtils]: 4: Hoare triple {142#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {122#true} is VALID [2020-07-28 19:08:13,783 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#true} ~x := #in~x; {175#(<= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:13,784 INFO L280 TraceCheckUtils]: 6: Hoare triple {175#(<= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-28 19:08:13,785 INFO L280 TraceCheckUtils]: 7: Hoare triple {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-28 19:08:13,787 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {155#(<= (+ |f91_#res| 10) |f91_#in~x|)} {142#(<= f91_~x 100)} #28#return; {147#(<= |f91_#t~ret0| 101)} is VALID [2020-07-28 19:08:13,787 INFO L280 TraceCheckUtils]: 9: Hoare triple {147#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {147#(<= |f91_#t~ret0| 101)} is VALID [2020-07-28 19:08:13,788 INFO L263 TraceCheckUtils]: 10: Hoare triple {147#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {122#true} is VALID [2020-07-28 19:08:13,789 INFO L280 TraceCheckUtils]: 11: Hoare triple {122#true} ~x := #in~x; {175#(<= f91_~x |f91_#in~x|)} is VALID [2020-07-28 19:08:13,790 INFO L280 TraceCheckUtils]: 12: Hoare triple {175#(<= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-28 19:08:13,791 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-28 19:08:13,793 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {156#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {147#(<= |f91_#t~ret0| 101)} #30#return; {152#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-28 19:08:13,794 INFO L280 TraceCheckUtils]: 15: Hoare triple {152#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-28 19:08:13,795 INFO L280 TraceCheckUtils]: 16: Hoare triple {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-28 19:08:13,797 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {153#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {122#true} #26#return; {140#(and (<= |ULTIMATE.start_main_#t~ret3| 91) (<= 91 |ULTIMATE.start_main_#t~ret3|))} is VALID [2020-07-28 19:08:13,798 INFO L280 TraceCheckUtils]: 18: Hoare triple {140#(and (<= |ULTIMATE.start_main_#t~ret3| 91) (<= 91 |ULTIMATE.start_main_#t~ret3|))} assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647;main_~result~0 := main_#t~ret3;havoc main_#t~ret3; {141#(and (< 90 ULTIMATE.start_main_~result~0) (<= ULTIMATE.start_main_~result~0 91))} is VALID [2020-07-28 19:08:13,799 INFO L280 TraceCheckUtils]: 19: Hoare triple {141#(and (< 90 ULTIMATE.start_main_~result~0) (<= ULTIMATE.start_main_~result~0 91))} assume !(91 == main_~result~0 || (main_~x~0 > 101 && main_~result~0 == main_~x~0 - 10)); {123#false} is VALID [2020-07-28 19:08:13,799 INFO L280 TraceCheckUtils]: 20: Hoare triple {123#false} assume !false; {123#false} is VALID [2020-07-28 19:08:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 19:08:13,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:08:13,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-07-28 19:08:13,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715429949] [2020-07-28 19:08:13,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-28 19:08:13,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:08:13,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 19:08:13,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:08:13,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 19:08:13,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:08:13,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 19:08:13,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:08:13,837 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 12 states. [2020-07-28 19:08:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:08:14,263 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-28 19:08:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 19:08:14,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-28 19:08:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:08:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:08:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2020-07-28 19:08:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:08:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2020-07-28 19:08:14,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 19 transitions. [2020-07-28 19:08:14,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:08:14,311 INFO L225 Difference]: With dead ends: 16 [2020-07-28 19:08:14,311 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 19:08:14,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-07-28 19:08:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 19:08:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 19:08:14,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:08:14,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 19:08:14,314 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:08:14,314 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:08:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:08:14,314 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:08:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:08:14,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:08:14,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:08:14,315 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:08:14,315 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:08:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:08:14,316 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:08:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:08:14,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:08:14,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:08:14,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:08:14,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:08:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 19:08:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 19:08:14,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-28 19:08:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:08:14,318 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 19:08:14,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 19:08:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:08:14,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:08:14,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 19:08:14,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 19:08:14,590 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 19:08:14,590 INFO L268 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2020-07-28 19:08:14,590 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 19:08:14,590 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 19:08:14,590 INFO L268 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2020-07-28 19:08:14,591 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-28 19:08:14,591 INFO L268 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2020-07-28 19:08:14,591 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2020-07-28 19:08:14,592 INFO L271 CegarLoopResult]: At program point L24(lines 24 32) the Hoare annotation is: true [2020-07-28 19:08:14,592 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-28 19:08:14,592 INFO L268 CegarLoopResult]: For program point L16(lines 16 20) no Hoare annotation was computed. [2020-07-28 19:08:14,592 INFO L268 CegarLoopResult]: For program point L19-3(line 19) no Hoare annotation was computed. [2020-07-28 19:08:14,592 INFO L271 CegarLoopResult]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true [2020-07-28 19:08:14,592 INFO L268 CegarLoopResult]: For program point f91FINAL(lines 15 21) no Hoare annotation was computed. [2020-07-28 19:08:14,593 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-28 19:08:14,593 INFO L268 CegarLoopResult]: For program point f91EXIT(lines 15 21) no Hoare annotation was computed. [2020-07-28 19:08:14,593 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-28 19:08:14,598 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 19:08:14,598 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 19:08:14,598 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-28 19:08:14,598 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 19:08:14,599 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 19:08:14,599 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-28 19:08:14,599 WARN L170 areAnnotationChecker]: f91FINAL has no Hoare annotation [2020-07-28 19:08:14,599 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 19:08:14,600 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 19:08:14,600 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 19:08:14,600 WARN L170 areAnnotationChecker]: f91EXIT has no Hoare annotation [2020-07-28 19:08:14,600 WARN L170 areAnnotationChecker]: f91EXIT has no Hoare annotation [2020-07-28 19:08:14,600 WARN L170 areAnnotationChecker]: f91EXIT has no Hoare annotation [2020-07-28 19:08:14,601 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 19:08:14,601 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:08:14,601 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 19:08:14,601 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 19:08:14,602 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-28 19:08:14,602 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-28 19:08:14,602 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:08:14,602 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 19:08:14,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 07:08:14 BoogieIcfgContainer [2020-07-28 19:08:14,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 19:08:14,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 19:08:14,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 19:08:14,611 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 19:08:14,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:08:11" (3/4) ... [2020-07-28 19:08:14,615 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 19:08:14,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f91 [2020-07-28 19:08:14,626 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 19:08:14,627 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 19:08:14,671 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 19:08:14,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 19:08:14,675 INFO L168 Benchmark]: Toolchain (without parser) took 3425.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 957.5 MB in the beginning and 836.2 MB in the end (delta: 121.4 MB). Peak memory consumption was 268.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:08:14,676 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:08:14,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.22 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:08:14,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.10 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:08:14,678 INFO L168 Benchmark]: Boogie Preprocessor took 74.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:08:14,679 INFO L168 Benchmark]: RCFGBuilder took 382.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2020-07-28 19:08:14,679 INFO L168 Benchmark]: TraceAbstraction took 2634.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 836.2 MB in the end (delta: 281.8 MB). Peak memory consumption was 281.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:08:14,680 INFO L168 Benchmark]: Witness Printer took 62.05 ms. Allocated memory is still 1.2 GB. Free memory is still 836.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:08:14,683 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 233.22 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.10 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 382.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2634.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 836.2 MB in the end (delta: 281.8 MB). Peak memory consumption was 281.8 MB. Max. memory is 11.5 GB. * Witness Printer took 62.05 ms. Allocated memory is still 1.2 GB. Free memory is still 836.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.4s, OverallIterations: 2, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 SDtfs, 16 SDslu, 57 SDs, 0 SdLazy, 137 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 11 PreInvPairs, 13 NumberOfFragments, 20 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 3856 SizeOfPredicates, 5 NumberOfNonLiveVariables, 53 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 16/24 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...