/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 11:11:52,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:11:52,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:11:52,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:11:52,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:11:52,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:11:52,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:11:52,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:11:52,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:11:52,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:11:52,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:11:52,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:11:52,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:11:52,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:11:52,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:11:52,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:11:52,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:11:52,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:11:52,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:11:52,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:11:52,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:11:52,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:11:52,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:11:52,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:11:52,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:11:52,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:11:52,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:11:52,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:11:52,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:11:52,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:11:52,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:11:52,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:11:52,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:11:52,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:11:52,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:11:52,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:11:52,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:11:52,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:11:52,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:11:52,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:11:52,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:11:52,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-07 11:11:52,263 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:11:52,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:11:52,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:11:52,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:11:52,265 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:11:52,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:11:52,266 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:11:52,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:11:52,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:11:52,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:11:52,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:11:52,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:11:52,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:11:52,267 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:11:52,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:11:52,268 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:11:52,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:11:52,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:11:52,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:11:52,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:11:52,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:11:52,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:11:52,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:11:52,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:11:52,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:11:52,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:11:52,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:11:52,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:11:52,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:11:52,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:11:52,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:11:52,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:11:52,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:11:52,598 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:11:52,598 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:11:52,599 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-07 11:11:52,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b720d9f/5e01123afbc14c71aec41a8e14dc7791/FLAG034cfe420 [2020-07-07 11:11:53,066 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:11:53,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-07 11:11:53,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b720d9f/5e01123afbc14c71aec41a8e14dc7791/FLAG034cfe420 [2020-07-07 11:11:53,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b720d9f/5e01123afbc14c71aec41a8e14dc7791 [2020-07-07 11:11:53,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:11:53,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:11:53,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:11:53,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:11:53,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:11:53,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:11:53" (1/1) ... [2020-07-07 11:11:53,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1a3246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53, skipping insertion in model container [2020-07-07 11:11:53,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:11:53" (1/1) ... [2020-07-07 11:11:53,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:11:53,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:11:53,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:11:53,717 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:11:53,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:11:53,749 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:11:53,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53 WrapperNode [2020-07-07 11:11:53,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:11:53,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:11:53,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:11:53,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:11:53,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53" (1/1) ... [2020-07-07 11:11:53,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53" (1/1) ... [2020-07-07 11:11:53,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53" (1/1) ... [2020-07-07 11:11:53,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53" (1/1) ... [2020-07-07 11:11:53,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53" (1/1) ... [2020-07-07 11:11:53,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53" (1/1) ... [2020-07-07 11:11:53,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53" (1/1) ... [2020-07-07 11:11:53,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:11:53,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:11:53,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:11:53,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:11:53,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11: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-07 11:11:53,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:11:53,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:11:53,956 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-07 11:11:53,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:11:53,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:11:53,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:11:53,957 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-07 11:11:53,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:11:53,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:11:53,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:11:54,168 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:11:54,169 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 11:11:54,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:11:54 BoogieIcfgContainer [2020-07-07 11:11:54,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:11:54,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:11:54,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:11:54,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:11:54,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:11:53" (1/3) ... [2020-07-07 11:11:54,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37230bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:11:54, skipping insertion in model container [2020-07-07 11:11:54,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:53" (2/3) ... [2020-07-07 11:11:54,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37230bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:11:54, skipping insertion in model container [2020-07-07 11:11:54,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:11:54" (3/3) ... [2020-07-07 11:11:54,205 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-07-07 11:11:54,234 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:11:54,253 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:11:54,270 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:11:54,294 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:11:54,295 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:11:54,295 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:11:54,295 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:11:54,295 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:11:54,295 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:11:54,296 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:11:54,296 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:11:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-07 11:11:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-07 11:11:54,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:54,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:54,323 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-07 11:11:54,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:54,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330062484] [2020-07-07 11:11:54,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:54,537 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-07 11:11:54,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330062484] [2020-07-07 11:11:54,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:11:54,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:11:54,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263595856] [2020-07-07 11:11:54,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:11:54,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:11:54,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:11:54,558 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-07 11:11:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:54,671 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-07 11:11:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:11:54,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-07 11:11:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:54,683 INFO L225 Difference]: With dead ends: 35 [2020-07-07 11:11:54,684 INFO L226 Difference]: Without dead ends: 21 [2020-07-07 11:11:54,687 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:11:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-07 11:11:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-07 11:11:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-07 11:11:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-07 11:11:54,735 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-07 11:11:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:54,736 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-07 11:11:54,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:11:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-07 11:11:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-07 11:11:54,738 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:54,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:54,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:11:54,739 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:54,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-07 11:11:54,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:54,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158300384] [2020-07-07 11:11:54,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:54,801 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-07 11:11:54,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158300384] [2020-07-07 11:11:54,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:11:54,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:11:54,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853730046] [2020-07-07 11:11:54,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:11:54,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:11:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:11:54,806 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-07 11:11:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:54,882 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-07 11:11:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:11:54,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-07 11:11:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:54,884 INFO L225 Difference]: With dead ends: 27 [2020-07-07 11:11:54,885 INFO L226 Difference]: Without dead ends: 23 [2020-07-07 11:11:54,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:11:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-07 11:11:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-07 11:11:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-07 11:11:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-07 11:11:54,894 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-07 11:11:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:54,894 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-07 11:11:54,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:11:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-07 11:11:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-07 11:11:54,896 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:54,896 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:54,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:11:54,897 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:54,898 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-07 11:11:54,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:54,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726633577] [2020-07-07 11:11:54,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 11:11:55,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726633577] [2020-07-07 11:11:55,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840252010] [2020-07-07 11:11:55,026 INFO L94 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-07 11:11:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:55,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-07 11:11:55,071 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 11:11:55,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:55,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-07-07 11:11:55,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317125946] [2020-07-07 11:11:55,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:11:55,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:55,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:11:55,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:11:55,169 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-07 11:11:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:55,312 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-07 11:11:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 11:11:55,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-07 11:11:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:55,314 INFO L225 Difference]: With dead ends: 38 [2020-07-07 11:11:55,314 INFO L226 Difference]: Without dead ends: 23 [2020-07-07 11:11:55,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:11:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-07 11:11:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-07 11:11:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-07 11:11:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-07 11:11:55,323 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-07 11:11:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:55,324 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-07 11:11:55,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:11:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-07 11:11:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-07 11:11:55,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:55,326 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:55,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-07 11:11:55,541 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:55,542 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-07 11:11:55,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:55,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571662305] [2020-07-07 11:11:55,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 11:11:55,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571662305] [2020-07-07 11:11:55,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585443991] [2020-07-07 11:11:55,716 INFO L94 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-07 11:11:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:55,754 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-07 11:11:55,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 11:11:55,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:55,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-07 11:11:55,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520487466] [2020-07-07 11:11:55,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:11:55,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:55,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:11:55,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:11:55,793 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 8 states. [2020-07-07 11:11:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:55,902 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-07 11:11:55,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 11:11:55,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-07 11:11:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:55,909 INFO L225 Difference]: With dead ends: 41 [2020-07-07 11:11:55,909 INFO L226 Difference]: Without dead ends: 37 [2020-07-07 11:11:55,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:11:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-07 11:11:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-07 11:11:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-07 11:11:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-07 11:11:55,920 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-07 11:11:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:55,921 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-07 11:11:55,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:11:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-07 11:11:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-07 11:11:55,923 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:55,923 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:56,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:56,137 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-07-07 11:11:56,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:56,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324304072] [2020-07-07 11:11:56,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-07 11:11:56,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324304072] [2020-07-07 11:11:56,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131403543] [2020-07-07 11:11:56,285 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:56,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-07 11:11:56,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:11:56,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-07 11:11:56,324 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 11:11:56,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:56,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-07-07 11:11:56,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610806887] [2020-07-07 11:11:56,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:11:56,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:56,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:11:56,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:11:56,386 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 13 states. [2020-07-07 11:11:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:56,596 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-07-07 11:11:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 11:11:56,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-07 11:11:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:56,598 INFO L225 Difference]: With dead ends: 72 [2020-07-07 11:11:56,598 INFO L226 Difference]: Without dead ends: 41 [2020-07-07 11:11:56,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:11:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-07 11:11:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-07 11:11:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-07 11:11:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-07 11:11:56,609 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2020-07-07 11:11:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:56,609 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-07 11:11:56,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:11:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-07 11:11:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-07 11:11:56,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:56,612 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:56,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:56,826 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:56,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 3 times [2020-07-07 11:11:56,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:56,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341243273] [2020-07-07 11:11:56,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 80 proven. 101 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-07-07 11:11:57,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341243273] [2020-07-07 11:11:57,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738924263] [2020-07-07 11:11:57,279 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:57,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-07 11:11:57,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:11:57,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-07 11:11:57,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-07-07 11:11:57,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:57,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 17 [2020-07-07 11:11:57,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990460498] [2020-07-07 11:11:57,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-07 11:11:57,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-07 11:11:57,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2020-07-07 11:11:57,381 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 17 states. [2020-07-07 11:11:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:57,802 INFO L93 Difference]: Finished difference Result 98 states and 155 transitions. [2020-07-07 11:11:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 11:11:57,803 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2020-07-07 11:11:57,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:57,809 INFO L225 Difference]: With dead ends: 98 [2020-07-07 11:11:57,809 INFO L226 Difference]: Without dead ends: 66 [2020-07-07 11:11:57,815 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2020-07-07 11:11:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-07 11:11:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2020-07-07 11:11:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-07 11:11:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2020-07-07 11:11:57,841 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 82 [2020-07-07 11:11:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:57,842 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2020-07-07 11:11:57,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-07 11:11:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2020-07-07 11:11:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-07 11:11:57,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:57,848 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:58,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:58,070 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:58,071 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 4 times [2020-07-07 11:11:58,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:58,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679171215] [2020-07-07 11:11:58,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2020-07-07 11:11:58,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679171215] [2020-07-07 11:11:58,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632800915] [2020-07-07 11:11:58,821 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:58,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-07 11:11:58,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:11:58,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-07 11:11:58,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2020-07-07 11:11:59,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:59,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 22 [2020-07-07 11:11:59,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789855666] [2020-07-07 11:11:59,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-07 11:11:59,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:59,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-07 11:11:59,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2020-07-07 11:11:59,058 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand 22 states. [2020-07-07 11:11:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:59,616 INFO L93 Difference]: Finished difference Result 142 states and 253 transitions. [2020-07-07 11:11:59,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-07 11:11:59,620 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 218 [2020-07-07 11:11:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:59,624 INFO L225 Difference]: With dead ends: 142 [2020-07-07 11:11:59,624 INFO L226 Difference]: Without dead ends: 87 [2020-07-07 11:11:59,626 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2020-07-07 11:11:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-07 11:11:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2020-07-07 11:11:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-07 11:11:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2020-07-07 11:11:59,640 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 218 [2020-07-07 11:11:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:59,640 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2020-07-07 11:11:59,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-07 11:11:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2020-07-07 11:11:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-07 11:11:59,644 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:59,644 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:59,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-07 11:11:59,851 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 5 times [2020-07-07 11:11:59,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:59,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072592404] [2020-07-07 11:11:59,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:11:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:12:00,018 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 11:12:00,019 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 11:12:00,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 11:12:00,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:12:00 BoogieIcfgContainer [2020-07-07 11:12:00,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:12:00,114 INFO L168 Benchmark]: Toolchain (without parser) took 6639.53 ms. Allocated memory was 143.7 MB in the beginning and 291.0 MB in the end (delta: 147.3 MB). Free memory was 101.1 MB in the beginning and 90.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 157.9 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:00,116 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-07 11:12:00,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.33 ms. Allocated memory is still 143.7 MB. Free memory was 100.9 MB in the beginning and 91.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:00,117 INFO L168 Benchmark]: Boogie Preprocessor took 30.31 ms. Allocated memory is still 143.7 MB. Free memory was 91.6 MB in the beginning and 90.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:00,120 INFO L168 Benchmark]: RCFGBuilder took 392.71 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.0 MB in the beginning and 169.2 MB in the end (delta: -79.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:00,121 INFO L168 Benchmark]: TraceAbstraction took 5924.76 ms. Allocated memory was 201.3 MB in the beginning and 291.0 MB in the end (delta: 89.7 MB). Free memory was 168.5 MB in the beginning and 90.5 MB in the end (delta: 78.0 MB). Peak memory consumption was 167.6 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:00,133 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.33 ms. Allocated memory is still 143.7 MB. Free memory was 100.9 MB in the beginning and 91.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.31 ms. Allocated memory is still 143.7 MB. Free memory was 91.6 MB in the beginning and 90.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.71 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.0 MB in the beginning and 169.2 MB in the end (delta: -79.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5924.76 ms. Allocated memory was 201.3 MB in the beginning and 291.0 MB in the end (delta: 89.7 MB). Free memory was 168.5 MB in the beginning and 90.5 MB in the end (delta: 78.0 MB). Peak memory consumption was 167.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 41, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 137 SDtfs, 346 SDslu, 454 SDs, 0 SdLazy, 745 SolverSat, 364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=7, 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, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 801 ConstructedInterpolants, 0 QuantifiedInterpolants, 191281 SizeOfPredicates, 21 NumberOfNonLiveVariables, 727 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 4292/5896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...