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/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:12:41,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:12:41,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:12:41,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:12:41,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:12:41,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:12:41,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:12:41,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:12:41,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:12:41,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:12:41,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:12:41,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:12:41,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:12:41,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:12:41,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:12:41,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:12:41,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:12:41,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:12:41,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:12:41,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:12:41,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:12:41,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:12:41,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:12:41,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:12:41,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:12:41,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:12:41,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:12:41,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:12:41,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:12:41,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:12:41,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:12:41,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:12:41,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:12:41,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:12:41,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:12:41,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:12:41,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:12:41,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:12:41,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:12:41,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:12:41,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:12:41,762 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 [2019-09-08 06:12:41,775 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:12:41,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:12:41,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:12:41,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:12:41,777 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:12:41,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:12:41,778 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:12:41,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:12:41,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:12:41,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:12:41,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:12:41,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:12:41,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:12:41,779 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:12:41,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:12:41,779 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:12:41,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:12:41,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:12:41,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:12:41,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:12:41,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:12:41,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:12:41,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:12:41,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:12:41,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:12:41,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:12:41,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:12:41,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:12:41,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:12:41,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:12:41,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:12:41,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:12:41,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:12:41,827 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:12:41,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2019-09-08 06:12:41,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37811d0e4/647dec5dbfe54aa39a6ca62dc138b66a/FLAGf94975ca6 [2019-09-08 06:12:42,390 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:12:42,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2019-09-08 06:12:42,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37811d0e4/647dec5dbfe54aa39a6ca62dc138b66a/FLAGf94975ca6 [2019-09-08 06:12:42,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37811d0e4/647dec5dbfe54aa39a6ca62dc138b66a [2019-09-08 06:12:42,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:12:42,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:12:42,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:12:42,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:12:42,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:12:42,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:12:42" (1/1) ... [2019-09-08 06:12:42,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11da6c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:42, skipping insertion in model container [2019-09-08 06:12:42,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:12:42" (1/1) ... [2019-09-08 06:12:42,820 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:12:42,838 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:12:43,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:12:43,018 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:12:43,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:12:43,053 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:12:43,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43 WrapperNode [2019-09-08 06:12:43,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:12:43,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:12:43,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:12:43,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:12:43,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43" (1/1) ... [2019-09-08 06:12:43,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43" (1/1) ... [2019-09-08 06:12:43,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43" (1/1) ... [2019-09-08 06:12:43,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43" (1/1) ... [2019-09-08 06:12:43,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43" (1/1) ... [2019-09-08 06:12:43,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43" (1/1) ... [2019-09-08 06:12:43,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43" (1/1) ... [2019-09-08 06:12:43,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:12:43,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:12:43,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:12:43,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:12:43,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43" (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 [2019-09-08 06:12:43,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:12:43,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:12:43,265 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-09-08 06:12:43,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:12:43,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:12:43,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:12:43,266 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-09-08 06:12:43,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:12:43,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:12:43,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:12:43,507 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:12:43,508 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 06:12:43,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:12:43 BoogieIcfgContainer [2019-09-08 06:12:43,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:12:43,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:12:43,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:12:43,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:12:43,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:12:42" (1/3) ... [2019-09-08 06:12:43,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556713e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:12:43, skipping insertion in model container [2019-09-08 06:12:43,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:43" (2/3) ... [2019-09-08 06:12:43,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556713e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:12:43, skipping insertion in model container [2019-09-08 06:12:43,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:12:43" (3/3) ... [2019-09-08 06:12:43,525 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2019-09-08 06:12:43,546 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:12:43,567 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:12:43,590 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:12:43,629 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:12:43,630 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:12:43,630 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:12:43,631 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:12:43,632 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:12:43,632 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:12:43,632 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:12:43,632 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:12:43,632 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:12:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-08 06:12:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 06:12:43,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:43,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:43,672 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2019-09-08 06:12:43,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:43,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:43,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:43,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:43,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:12:43,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:12:43,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:12:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:12:43,884 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-09-08 06:12:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:44,024 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-09-08 06:12:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:12:44,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-08 06:12:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:44,037 INFO L225 Difference]: With dead ends: 35 [2019-09-08 06:12:44,038 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 06:12:44,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 06:12:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-08 06:12:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 06:12:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-08 06:12:44,087 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-09-08 06:12:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:44,089 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-08 06:12:44,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:12:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-08 06:12:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 06:12:44,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:44,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:44,093 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2019-09-08 06:12:44,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:44,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:44,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:44,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:44,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:44,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:44,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:12:44,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:12:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:12:44,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:12:44,170 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-09-08 06:12:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:44,263 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-09-08 06:12:44,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:12:44,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 06:12:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:44,266 INFO L225 Difference]: With dead ends: 27 [2019-09-08 06:12:44,267 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 06:12:44,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 06:12:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-09-08 06:12:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 06:12:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-08 06:12:44,286 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2019-09-08 06:12:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:44,286 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-08 06:12:44,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:12:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-08 06:12:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 06:12:44,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:44,291 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:44,291 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2019-09-08 06:12:44,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:44,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:44,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 06:12:44,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:44,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:12:44,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:44,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:12:44,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 06:12:44,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:44,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-08 06:12:44,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:12:44,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:12:44,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:12:44,641 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2019-09-08 06:12:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:44,814 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-09-08 06:12:44,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:12:44,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-09-08 06:12:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:44,816 INFO L225 Difference]: With dead ends: 38 [2019-09-08 06:12:44,817 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 06:12:44,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:12:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 06:12:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 06:12:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 06:12:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-08 06:12:44,832 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2019-09-08 06:12:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:44,833 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-08 06:12:44,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:12:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-08 06:12:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 06:12:44,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:44,837 INFO L399 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] [2019-09-08 06:12:44,838 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:44,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:44,839 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2019-09-08 06:12:44,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:44,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:12:44,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:44,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:44,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:44,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:12:44,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:12:45,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:45,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 06:12:45,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:12:45,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:12:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:45,023 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-08 06:12:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:45,107 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2019-09-08 06:12:45,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:12:45,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-08 06:12:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:45,110 INFO L225 Difference]: With dead ends: 32 [2019-09-08 06:12:45,110 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 06:12:45,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:12:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 06:12:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-08 06:12:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 06:12:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-09-08 06:12:45,119 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2019-09-08 06:12:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:45,120 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-09-08 06:12:45,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:12:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2019-09-08 06:12:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 06:12:45,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:45,122 INFO L399 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] [2019-09-08 06:12:45,122 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2019-09-08 06:12:45,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:45,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:45,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:12:45,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:45,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:45,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:12:45,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:12:45,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:45,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:12:45,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:12:45,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:45,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-09-08 06:12:45,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 06:12:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 06:12:45,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 06:12:45,371 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 13 states. [2019-09-08 06:12:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:45,727 INFO L93 Difference]: Finished difference Result 65 states and 96 transitions. [2019-09-08 06:12:45,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 06:12:45,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-08 06:12:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:45,731 INFO L225 Difference]: With dead ends: 65 [2019-09-08 06:12:45,732 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 06:12:45,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:12:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 06:12:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-09-08 06:12:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 06:12:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-09-08 06:12:45,751 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 40 [2019-09-08 06:12:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:45,753 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-09-08 06:12:45,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 06:12:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2019-09-08 06:12:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 06:12:45,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:45,759 INFO L399 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] [2019-09-08 06:12:45,761 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1541039141, now seen corresponding path program 3 times [2019-09-08 06:12:45,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:45,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:45,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:45,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:45,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-08 06:12:45,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:45,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:45,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:12:45,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-08 06:12:45,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:45,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:12:45,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-08 06:12:46,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:46,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 06:12:46,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:12:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:12:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:12:46,011 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 7 states. [2019-09-08 06:12:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:46,148 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2019-09-08 06:12:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:12:46,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-08 06:12:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:46,152 INFO L225 Difference]: With dead ends: 48 [2019-09-08 06:12:46,152 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 06:12:46,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:12:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 06:12:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-08 06:12:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 06:12:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2019-09-08 06:12:46,164 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 82 [2019-09-08 06:12:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:46,164 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-09-08 06:12:46,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:12:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2019-09-08 06:12:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 06:12:46,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:46,167 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:46,167 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:46,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:46,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1737041458, now seen corresponding path program 4 times [2019-09-08 06:12:46,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:46,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:46,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:46,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:46,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 145 proven. 154 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-09-08 06:12:46,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:46,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:12:46,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:46,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:12:46,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:46,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 06:12:46,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 147 proven. 149 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-08 06:12:46,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:46,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-09-08 06:12:46,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:12:46,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:12:46,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:12:46,478 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand 12 states. [2019-09-08 06:12:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:46,623 INFO L93 Difference]: Finished difference Result 72 states and 122 transitions. [2019-09-08 06:12:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:12:46,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2019-09-08 06:12:46,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:46,630 INFO L225 Difference]: With dead ends: 72 [2019-09-08 06:12:46,630 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 06:12:46,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:12:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 06:12:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-08 06:12:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-08 06:12:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-09-08 06:12:46,658 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 123 [2019-09-08 06:12:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:46,658 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-09-08 06:12:46,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:12:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-09-08 06:12:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 06:12:46,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:46,666 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:46,667 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1066463687, now seen corresponding path program 5 times [2019-09-08 06:12:46,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:46,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:46,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 212 proven. 59 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-09-08 06:12:46,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:46,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:12:46,889 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:46,935 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-08 06:12:46,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:46,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 06:12:46,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-09-08 06:12:47,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:47,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2019-09-08 06:12:47,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 06:12:47,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 06:12:47,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:12:47,098 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 18 states. [2019-09-08 06:12:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:47,595 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2019-09-08 06:12:47,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 06:12:47,596 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 136 [2019-09-08 06:12:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:47,598 INFO L225 Difference]: With dead ends: 111 [2019-09-08 06:12:47,598 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 06:12:47,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 06:12:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 06:12:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-09-08 06:12:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 06:12:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2019-09-08 06:12:47,609 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 136 [2019-09-08 06:12:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:47,610 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2019-09-08 06:12:47,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 06:12:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2019-09-08 06:12:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 06:12:47,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:47,612 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 10, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:47,612 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:47,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1589564690, now seen corresponding path program 6 times [2019-09-08 06:12:47,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:47,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:47,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 131 proven. 122 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-09-08 06:12:47,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:47,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:47,802 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:12:47,847 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-08 06:12:47,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:47,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:12:47,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 118 proven. 34 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-08 06:12:47,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:47,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 15 [2019-09-08 06:12:47,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 06:12:47,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 06:12:47,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:12:47,895 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 15 states. [2019-09-08 06:12:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:48,330 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2019-09-08 06:12:48,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 06:12:48,331 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2019-09-08 06:12:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:48,332 INFO L225 Difference]: With dead ends: 98 [2019-09-08 06:12:48,332 INFO L226 Difference]: Without dead ends: 59 [2019-09-08 06:12:48,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:12:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-08 06:12:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-09-08 06:12:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 06:12:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-09-08 06:12:48,341 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 95 [2019-09-08 06:12:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:48,342 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-09-08 06:12:48,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 06:12:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-09-08 06:12:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 06:12:48,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:48,343 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:48,344 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:48,344 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 7 times [2019-09-08 06:12:48,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:48,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:48,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:48,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 06:12:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 06:12:48,415 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 06:12:48,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:12:48 BoogieIcfgContainer [2019-09-08 06:12:48,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 06:12:48,468 INFO L168 Benchmark]: Toolchain (without parser) took 5665.47 ms. Allocated memory was 133.7 MB in the beginning and 296.2 MB in the end (delta: 162.5 MB). Free memory was 89.6 MB in the beginning and 154.1 MB in the end (delta: -64.5 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:48,469 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 06:12:48,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.33 ms. Allocated memory is still 133.7 MB. Free memory was 89.4 MB in the beginning and 80.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:48,471 INFO L168 Benchmark]: Boogie Preprocessor took 141.42 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 80.1 MB in the beginning and 177.5 MB in the end (delta: -97.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:48,472 INFO L168 Benchmark]: RCFGBuilder took 313.23 ms. Allocated memory is still 201.3 MB. Free memory was 177.5 MB in the beginning and 166.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:48,472 INFO L168 Benchmark]: TraceAbstraction took 4954.69 ms. Allocated memory was 201.3 MB in the beginning and 296.2 MB in the end (delta: 94.9 MB). Free memory was 166.3 MB in the beginning and 154.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 107.1 MB. Max. memory is 7.1 GB. [2019-09-08 06:12:48,476 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 251.33 ms. Allocated memory is still 133.7 MB. Free memory was 89.4 MB in the beginning and 80.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.42 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 80.1 MB in the beginning and 177.5 MB in the end (delta: -97.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 313.23 ms. Allocated memory is still 201.3 MB. Free memory was 177.5 MB in the beginning and 166.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4954.69 ms. Allocated memory was 201.3 MB in the beginning and 296.2 MB in the end (delta: 94.9 MB). Free memory was 166.3 MB in the beginning and 154.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 107.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L33] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 4.8s OverallTime, 10 OverallIterations, 19 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 183 SDtfs, 300 SDslu, 591 SDs, 0 SdLazy, 800 SolverSat, 249 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 537 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1194 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1069 ConstructedInterpolants, 0 QuantifiedInterpolants, 173699 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 3862/4930 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...