/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -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-d623d84 [2020-07-20 11:13:42,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 11:13:42,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 11:13:42,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 11:13:42,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 11:13:42,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 11:13:42,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 11:13:42,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 11:13:42,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 11:13:42,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 11:13:42,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 11:13:42,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 11:13:42,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 11:13:42,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 11:13:42,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 11:13:43,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 11:13:43,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 11:13:43,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 11:13:43,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 11:13:43,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 11:13:43,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 11:13:43,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 11:13:43,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 11:13:43,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 11:13:43,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 11:13:43,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 11:13:43,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 11:13:43,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 11:13:43,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 11:13:43,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 11:13:43,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 11:13:43,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 11:13:43,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 11:13:43,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 11:13:43,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 11:13:43,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 11:13:43,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 11:13:43,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 11:13:43,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 11:13:43,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 11:13:43,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 11:13:43,027 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-20 11:13:43,044 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 11:13:43,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 11:13:43,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 11:13:43,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 11:13:43,047 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 11:13:43,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 11:13:43,048 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 11:13:43,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 11:13:43,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 11:13:43,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 11:13:43,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 11:13:43,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 11:13:43,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 11:13:43,049 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 11:13:43,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 11:13:43,049 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 11:13:43,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 11:13:43,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 11:13:43,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 11:13:43,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 11:13:43,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 11:13:43,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 11:13:43,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 11:13:43,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 11:13:43,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 11:13:43,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 11:13:43,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:43,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 11:13:43,052 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 11:13:43,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-20 11:13:43,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 11:13:43,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 11:13:43,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 11:13:43,448 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 11:13:43,448 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 11:13:43,450 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-20 11:13:43,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0e72888/d17ac634120a4070a7ca3a7d04f938d9/FLAGf6c72314d [2020-07-20 11:13:44,249 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 11:13:44,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-20 11:13:44,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0e72888/d17ac634120a4070a7ca3a7d04f938d9/FLAGf6c72314d [2020-07-20 11:13:44,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0e72888/d17ac634120a4070a7ca3a7d04f938d9 [2020-07-20 11:13:44,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 11:13:44,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 11:13:44,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 11:13:44,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 11:13:44,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 11:13:44,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 11:13:44" (1/1) ... [2020-07-20 11:13:44,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ad6925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44, skipping insertion in model container [2020-07-20 11:13:44,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 11:13:44" (1/1) ... [2020-07-20 11:13:44,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 11:13:44,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 11:13:44,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 11:13:44,949 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 11:13:44,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 11:13:44,992 INFO L208 MainTranslator]: Completed translation [2020-07-20 11:13:44,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44 WrapperNode [2020-07-20 11:13:44,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 11:13:44,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 11:13:44,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 11:13:44,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 11:13:45,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44" (1/1) ... [2020-07-20 11:13:45,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44" (1/1) ... [2020-07-20 11:13:45,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44" (1/1) ... [2020-07-20 11:13:45,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44" (1/1) ... [2020-07-20 11:13:45,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44" (1/1) ... [2020-07-20 11:13:45,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44" (1/1) ... [2020-07-20 11:13:45,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44" (1/1) ... [2020-07-20 11:13:45,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 11:13:45,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 11:13:45,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 11:13:45,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 11:13:45,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44" (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-20 11:13:45,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 11:13:45,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 11:13:45,221 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-20 11:13:45,221 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 11:13:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 11:13:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 11:13:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-20 11:13:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 11:13:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 11:13:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 11:13:45,512 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 11:13:45,513 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 11:13:45,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 11:13:45 BoogieIcfgContainer [2020-07-20 11:13:45,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 11:13:45,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 11:13:45,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 11:13:45,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 11:13:45,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 11:13:44" (1/3) ... [2020-07-20 11:13:45,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d626a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 11:13:45, skipping insertion in model container [2020-07-20 11:13:45,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:13:44" (2/3) ... [2020-07-20 11:13:45,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1d626a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 11:13:45, skipping insertion in model container [2020-07-20 11:13:45,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 11:13:45" (3/3) ... [2020-07-20 11:13:45,578 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-07-20 11:13:45,615 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 11:13:45,626 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 11:13:45,649 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 11:13:45,701 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 11:13:45,701 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 11:13:45,704 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 11:13:45,706 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 11:13:45,706 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 11:13:45,706 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 11:13:45,706 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 11:13:45,707 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 11:13:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-20 11:13:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 11:13:45,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:45,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:13:45,742 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-20 11:13:45,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:45,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [398782306] [2020-07-20 11:13:45,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:45,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 11:13:45,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:45,957 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-20 11:13:45,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:13:45,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [398782306] [2020-07-20 11:13:45,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:13:45,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 11:13:45,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645010966] [2020-07-20 11:13:45,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 11:13:45,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 11:13:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 11:13:45,985 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-20 11:13:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:46,118 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 11:13:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 11:13:46,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 11:13:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:46,141 INFO L225 Difference]: With dead ends: 35 [2020-07-20 11:13:46,141 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 11:13:46,146 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-20 11:13:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 11:13:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 11:13:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 11:13:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 11:13:46,205 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 11:13:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:46,206 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 11:13:46,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 11:13:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 11:13:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 11:13:46,209 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:46,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:13:46,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:46,423 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-20 11:13:46,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:46,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [913303283] [2020-07-20 11:13:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:46,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 11:13:46,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:46,511 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-20 11:13:46,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:13:46,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [913303283] [2020-07-20 11:13:46,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:13:46,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 11:13:46,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939412052] [2020-07-20 11:13:46,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 11:13:46,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 11:13:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 11:13:46,523 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 11:13:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:46,640 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 11:13:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 11:13:46,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 11:13:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:46,645 INFO L225 Difference]: With dead ends: 27 [2020-07-20 11:13:46,645 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 11:13:46,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-20 11:13:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 11:13:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 11:13:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 11:13:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 11:13:46,670 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 11:13:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:46,671 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 11:13:46,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 11:13:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 11:13:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 11:13:46,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:46,679 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-20 11:13:46,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:46,895 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-20 11:13:46,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:46,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1158452868] [2020-07-20 11:13:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:46,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 11:13:46,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:47,013 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-20 11:13:47,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:13:47,205 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 11:13:47,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1158452868] [2020-07-20 11:13:47,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:13:47,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 11:13:47,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016720171] [2020-07-20 11:13:47,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 11:13:47,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 11:13:47,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 11:13:47,264 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-20 11:13:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:47,403 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-20 11:13:47,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 11:13:47,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-20 11:13:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:47,406 INFO L225 Difference]: With dead ends: 32 [2020-07-20 11:13:47,406 INFO L226 Difference]: Without dead ends: 28 [2020-07-20 11:13:47,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-20 11:13:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-20 11:13:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-20 11:13:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 11:13:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 11:13:47,419 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-20 11:13:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:47,420 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 11:13:47,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 11:13:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 11:13:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 11:13:47,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:47,422 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-20 11:13:47,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:47,639 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-20 11:13:47,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:47,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697553993] [2020-07-20 11:13:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:47,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 11:13:47,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:47,735 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-20 11:13:47,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:13:47,897 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 11:13:47,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697553993] [2020-07-20 11:13:47,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:13:47,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 11:13:47,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146563822] [2020-07-20 11:13:47,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 11:13:47,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:47,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 11:13:47,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 11:13:47,942 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-20 11:13:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:48,062 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-20 11:13:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 11:13:48,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-20 11:13:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:48,066 INFO L225 Difference]: With dead ends: 37 [2020-07-20 11:13:48,066 INFO L226 Difference]: Without dead ends: 33 [2020-07-20 11:13:48,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-20 11:13:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-20 11:13:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-20 11:13:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 11:13:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 11:13:48,080 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-20 11:13:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:48,081 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 11:13:48,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 11:13:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 11:13:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-20 11:13:48,083 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:48,084 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] [2020-07-20 11:13:48,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:48,299 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:48,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:48,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-20 11:13:48,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:48,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989817287] [2020-07-20 11:13:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:48,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 11:13:48,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-20 11:13:48,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:13:48,699 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:48,701 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:48,755 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:48,757 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 11:13:48,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989817287] [2020-07-20 11:13:48,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:13:48,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 11:13:48,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128222025] [2020-07-20 11:13:48,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 11:13:48,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:48,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 11:13:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 11:13:48,801 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-20 11:13:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:49,008 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-20 11:13:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 11:13:49,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-20 11:13:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:49,011 INFO L225 Difference]: With dead ends: 42 [2020-07-20 11:13:49,011 INFO L226 Difference]: Without dead ends: 38 [2020-07-20 11:13:49,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-20 11:13:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-20 11:13:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-20 11:13:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 11:13:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 11:13:49,026 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-20 11:13:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:49,026 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 11:13:49,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 11:13:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 11:13:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-20 11:13:49,029 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:49,029 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:13:49,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:49,244 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-20 11:13:49,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:49,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [151345687] [2020-07-20 11:13:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:49,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 11:13:49,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 11:13:49,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:13:49,643 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:49,705 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:49,706 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 11:13:49,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [151345687] [2020-07-20 11:13:49,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:13:49,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 11:13:49,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390405424] [2020-07-20 11:13:49,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 11:13:49,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:49,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 11:13:49,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 11:13:49,753 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-20 11:13:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:49,927 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-20 11:13:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 11:13:49,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-20 11:13:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:49,936 INFO L225 Difference]: With dead ends: 47 [2020-07-20 11:13:49,937 INFO L226 Difference]: Without dead ends: 43 [2020-07-20 11:13:49,938 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-20 11:13:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-20 11:13:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-20 11:13:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 11:13:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 11:13:49,965 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-20 11:13:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:49,967 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 11:13:49,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 11:13:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 11:13:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 11:13:49,980 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:49,980 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:13:50,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:50,198 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-20 11:13:50,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:50,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947244982] [2020-07-20 11:13:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:50,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 11:13:50,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-20 11:13:50,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:13:50,789 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:50,891 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:50,892 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:50,951 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:50,952 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-20 11:13:50,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1947244982] [2020-07-20 11:13:50,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:13:50,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 11:13:50,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776318720] [2020-07-20 11:13:50,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 11:13:50,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:50,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 11:13:50,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 11:13:50,994 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-20 11:13:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:51,191 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-20 11:13:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 11:13:51,192 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-20 11:13:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:51,195 INFO L225 Difference]: With dead ends: 52 [2020-07-20 11:13:51,195 INFO L226 Difference]: Without dead ends: 48 [2020-07-20 11:13:51,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-20 11:13:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-20 11:13:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-20 11:13:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 11:13:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 11:13:51,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-20 11:13:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:51,212 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 11:13:51,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 11:13:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 11:13:51,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-20 11:13:51,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:51,215 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:13:51,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:51,429 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:51,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-20 11:13:51,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:51,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821957903] [2020-07-20 11:13:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:51,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 11:13:51,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-20 11:13:51,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:13:52,084 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:52,204 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:52,206 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:52,258 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2020-07-20 11:13:52,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821957903] [2020-07-20 11:13:52,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:13:52,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 11:13:52,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363279348] [2020-07-20 11:13:52,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 11:13:52,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 11:13:52,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 11:13:52,306 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 13 states. [2020-07-20 11:13:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:52,444 INFO L93 Difference]: Finished difference Result 57 states and 122 transitions. [2020-07-20 11:13:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 11:13:52,449 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-07-20 11:13:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:52,451 INFO L225 Difference]: With dead ends: 57 [2020-07-20 11:13:52,452 INFO L226 Difference]: Without dead ends: 53 [2020-07-20 11:13:52,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-20 11:13:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-20 11:13:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-07-20 11:13:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 11:13:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 11:13:52,473 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 96 [2020-07-20 11:13:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:52,474 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 11:13:52,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 11:13:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 11:13:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-20 11:13:52,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:52,476 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:13:52,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:52,679 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash 838335741, now seen corresponding path program 4 times [2020-07-20 11:13:52,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:52,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [243185307] [2020-07-20 11:13:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:52,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 11:13:52,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 244 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2020-07-20 11:13:52,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:13:53,429 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:53,430 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:53,596 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:53,693 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:53,738 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 266 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2020-07-20 11:13:53,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [243185307] [2020-07-20 11:13:53,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:13:53,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-20 11:13:53,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975144409] [2020-07-20 11:13:53,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 11:13:53,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 11:13:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-20 11:13:53,782 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 15 states. [2020-07-20 11:13:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:54,074 INFO L93 Difference]: Finished difference Result 62 states and 144 transitions. [2020-07-20 11:13:54,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 11:13:54,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-07-20 11:13:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:54,079 INFO L225 Difference]: With dead ends: 62 [2020-07-20 11:13:54,079 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 11:13:54,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-20 11:13:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 11:13:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2020-07-20 11:13:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 11:13:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-20 11:13:54,093 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 117 [2020-07-20 11:13:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:54,093 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-20 11:13:54,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 11:13:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-20 11:13:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-20 11:13:54,096 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:54,096 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 21, 13, 13, 13, 13, 13, 13, 13, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:13:54,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:54,312 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:54,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2072922826, now seen corresponding path program 4 times [2020-07-20 11:13:54,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:54,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [422368915] [2020-07-20 11:13:54,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:54,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 11:13:54,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 506 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2020-07-20 11:13:54,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:13:55,232 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:55,419 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:55,501 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:55,502 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:55,550 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:55,552 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 532 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2020-07-20 11:13:55,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [422368915] [2020-07-20 11:13:55,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:13:55,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-20 11:13:55,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332145845] [2020-07-20 11:13:55,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 11:13:55,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:55,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 11:13:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-20 11:13:55,623 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 15 states. [2020-07-20 11:13:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:55,786 INFO L93 Difference]: Finished difference Result 67 states and 168 transitions. [2020-07-20 11:13:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 11:13:55,787 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2020-07-20 11:13:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:55,790 INFO L225 Difference]: With dead ends: 67 [2020-07-20 11:13:55,790 INFO L226 Difference]: Without dead ends: 63 [2020-07-20 11:13:55,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 356 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-20 11:13:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-20 11:13:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2020-07-20 11:13:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 11:13:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-20 11:13:55,817 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 190 [2020-07-20 11:13:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:55,818 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-20 11:13:55,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 11:13:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-20 11:13:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-20 11:13:55,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:55,827 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:13:56,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:56,042 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1082984306, now seen corresponding path program 5 times [2020-07-20 11:13:56,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:56,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1012249862] [2020-07-20 11:13:56,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:56,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 11:13:56,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 967 refuted. 0 times theorem prover too weak. 3536 trivial. 0 not checked. [2020-07-20 11:13:56,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:13:57,485 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:57,811 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:57,960 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:58,042 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:58,097 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:58,097 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:13:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 1002 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2020-07-20 11:13:58,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1012249862] [2020-07-20 11:13:58,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:13:58,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-20 11:13:58,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436425933] [2020-07-20 11:13:58,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 11:13:58,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:13:58,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 11:13:58,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-20 11:13:58,220 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-20 11:13:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:13:58,422 INFO L93 Difference]: Finished difference Result 72 states and 194 transitions. [2020-07-20 11:13:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 11:13:58,423 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 286 [2020-07-20 11:13:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:13:58,426 INFO L225 Difference]: With dead ends: 72 [2020-07-20 11:13:58,426 INFO L226 Difference]: Without dead ends: 68 [2020-07-20 11:13:58,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 545 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-20 11:13:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-20 11:13:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2020-07-20 11:13:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 11:13:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 11:13:58,453 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 286 [2020-07-20 11:13:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:13:58,455 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 11:13:58,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 11:13:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 11:13:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2020-07-20 11:13:58,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:13:58,463 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 35, 21, 21, 21, 21, 21, 21, 21, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:13:58,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:58,677 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:13:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:13:58,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1101007572, now seen corresponding path program 5 times [2020-07-20 11:13:58,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:13:58,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1012667179] [2020-07-20 11:13:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:13:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:13:58,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 11:13:58,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:13:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 159 proven. 1061 refuted. 0 times theorem prover too weak. 3827 trivial. 0 not checked. [2020-07-20 11:13:58,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:14:00,085 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:00,421 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:00,570 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:00,658 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:00,659 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:00,703 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 159 proven. 1101 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [2020-07-20 11:14:00,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1012667179] [2020-07-20 11:14:00,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:14:00,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 16 [2020-07-20 11:14:00,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928733118] [2020-07-20 11:14:00,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 11:14:00,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:14:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 11:14:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-07-20 11:14:00,804 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 16 states. [2020-07-20 11:14:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:14:01,032 INFO L93 Difference]: Finished difference Result 77 states and 222 transitions. [2020-07-20 11:14:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 11:14:01,033 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 300 [2020-07-20 11:14:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:14:01,036 INFO L225 Difference]: With dead ends: 77 [2020-07-20 11:14:01,036 INFO L226 Difference]: Without dead ends: 73 [2020-07-20 11:14:01,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 572 SyntacticMatches, 13 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2020-07-20 11:14:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-20 11:14:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2020-07-20 11:14:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 11:14:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 11:14:01,049 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 300 [2020-07-20 11:14:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:14:01,050 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 11:14:01,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 11:14:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 11:14:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2020-07-20 11:14:01,053 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:14:01,053 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:14:01,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:14:01,267 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:14:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:14:01,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2028798950, now seen corresponding path program 6 times [2020-07-20 11:14:01,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:14:01,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1041696523] [2020-07-20 11:14:01,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:14:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:14:01,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 11:14:01,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:14:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 256 proven. 1325 refuted. 0 times theorem prover too weak. 5019 trivial. 0 not checked. [2020-07-20 11:14:01,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:14:03,091 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:03,593 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:03,847 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:04,020 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:04,021 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:04,103 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:04,151 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:04,152 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 256 proven. 1376 refuted. 0 times theorem prover too weak. 4968 trivial. 0 not checked. [2020-07-20 11:14:04,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1041696523] [2020-07-20 11:14:04,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:14:04,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 18 [2020-07-20 11:14:04,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991710003] [2020-07-20 11:14:04,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 11:14:04,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:14:04,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 11:14:04,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-07-20 11:14:04,239 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 18 states. [2020-07-20 11:14:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:14:04,507 INFO L93 Difference]: Finished difference Result 82 states and 252 transitions. [2020-07-20 11:14:04,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 11:14:04,508 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 338 [2020-07-20 11:14:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:14:04,511 INFO L225 Difference]: With dead ends: 82 [2020-07-20 11:14:04,512 INFO L226 Difference]: Without dead ends: 78 [2020-07-20 11:14:04,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 645 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2020-07-20 11:14:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-20 11:14:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2020-07-20 11:14:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-20 11:14:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-20 11:14:04,530 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 338 [2020-07-20 11:14:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:14:04,531 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-20 11:14:04,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 11:14:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-20 11:14:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2020-07-20 11:14:04,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:14:04,535 INFO L422 BasicCegarLoop]: trace histogram [65, 65, 52, 32, 32, 32, 32, 32, 32, 32, 20, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:14:04,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:14:04,751 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:14:04,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:14:04,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1773208677, now seen corresponding path program 6 times [2020-07-20 11:14:04,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:14:04,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1030994152] [2020-07-20 11:14:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:14:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:14:04,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 11:14:04,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:14:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11630 backedges. 648 proven. 1702 refuted. 0 times theorem prover too weak. 9280 trivial. 0 not checked. [2020-07-20 11:14:05,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:14:06,806 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:06,807 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:07,428 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:07,429 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:07,667 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:07,831 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:07,832 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:07,966 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:08,022 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:08,093 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11630 backedges. 652 proven. 1749 refuted. 0 times theorem prover too weak. 9229 trivial. 0 not checked. [2020-07-20 11:14:08,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1030994152] [2020-07-20 11:14:08,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:14:08,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 18 [2020-07-20 11:14:08,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109728101] [2020-07-20 11:14:08,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 11:14:08,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:14:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 11:14:08,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-07-20 11:14:08,393 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 18 states. [2020-07-20 11:14:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:14:08,717 INFO L93 Difference]: Finished difference Result 147 states and 749 transitions. [2020-07-20 11:14:08,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 11:14:08,718 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 449 [2020-07-20 11:14:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:14:08,721 INFO L225 Difference]: With dead ends: 147 [2020-07-20 11:14:08,721 INFO L226 Difference]: Without dead ends: 70 [2020-07-20 11:14:08,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 866 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2020-07-20 11:14:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-20 11:14:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-20 11:14:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-20 11:14:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 122 transitions. [2020-07-20 11:14:08,740 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 122 transitions. Word has length 449 [2020-07-20 11:14:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:14:08,741 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 122 transitions. [2020-07-20 11:14:08,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 11:14:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 122 transitions. [2020-07-20 11:14:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2020-07-20 11:14:08,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:14:08,745 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 36, 20, 20, 20, 20, 20, 20, 20, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:14:08,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:14:08,959 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:14:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:14:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1606827399, now seen corresponding path program 7 times [2020-07-20 11:14:08,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:14:08,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [201645753] [2020-07-20 11:14:08,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:14:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:14:09,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 11:14:09,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:14:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4670 backedges. 303 proven. 870 refuted. 0 times theorem prover too weak. 3497 trivial. 0 not checked. [2020-07-20 11:14:09,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:14:10,489 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:10,490 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:10,810 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:10,989 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:10,990 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:11,076 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:11,119 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:11,120 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:11,146 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:11,163 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:14:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4670 backedges. 315 proven. 895 refuted. 0 times theorem prover too weak. 3460 trivial. 0 not checked. [2020-07-20 11:14:11,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [201645753] [2020-07-20 11:14:11,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:14:11,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 16 [2020-07-20 11:14:11,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024691459] [2020-07-20 11:14:11,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 11:14:11,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:14:11,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 11:14:11,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-07-20 11:14:11,288 INFO L87 Difference]: Start difference. First operand 70 states and 122 transitions. Second operand 16 states. [2020-07-20 11:14:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:14:11,539 INFO L93 Difference]: Finished difference Result 165 states and 347 transitions. [2020-07-20 11:14:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 11:14:11,540 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 289 [2020-07-20 11:14:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:14:11,542 INFO L225 Difference]: With dead ends: 165 [2020-07-20 11:14:11,543 INFO L226 Difference]: Without dead ends: 78 [2020-07-20 11:14:11,550 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 550 SyntacticMatches, 13 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2020-07-20 11:14:11,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-20 11:14:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2020-07-20 11:14:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-20 11:14:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2020-07-20 11:14:11,565 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 289 [2020-07-20 11:14:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:14:11,566 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2020-07-20 11:14:11,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 11:14:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2020-07-20 11:14:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-20 11:14:11,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:14:11,570 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-20 11:14:11,784 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:14:11,785 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:14:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:14:11,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 8 times [2020-07-20 11:14:11,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:14:11,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [792735753] [2020-07-20 11:14:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:14:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 11:14:11,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 11:14:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 11:14:12,035 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 11:14:12,087 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 11:14:12,087 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 11:14:12,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:14:12,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 11:14:12 BoogieIcfgContainer [2020-07-20 11:14:12,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 11:14:12,366 INFO L168 Benchmark]: Toolchain (without parser) took 27746.39 ms. Allocated memory was 143.1 MB in the beginning and 561.5 MB in the end (delta: 418.4 MB). Free memory was 99.7 MB in the beginning and 331.6 MB in the end (delta: -231.9 MB). Peak memory consumption was 186.5 MB. Max. memory is 7.1 GB. [2020-07-20 11:14:12,366 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 143.1 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 11:14:12,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.33 ms. Allocated memory is still 143.1 MB. Free memory was 99.3 MB in the beginning and 90.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-20 11:14:12,368 INFO L168 Benchmark]: Boogie Preprocessor took 41.27 ms. Allocated memory is still 143.1 MB. Free memory was 90.1 MB in the beginning and 88.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-20 11:14:12,368 INFO L168 Benchmark]: RCFGBuilder took 507.10 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 88.8 MB in the beginning and 169.0 MB in the end (delta: -80.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-20 11:14:12,369 INFO L168 Benchmark]: TraceAbstraction took 26814.49 ms. Allocated memory was 200.8 MB in the beginning and 561.5 MB in the end (delta: 360.7 MB). Free memory was 168.3 MB in the beginning and 331.6 MB in the end (delta: -163.3 MB). Peak memory consumption was 197.4 MB. Max. memory is 7.1 GB. [2020-07-20 11:14:12,372 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 143.1 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 368.33 ms. Allocated memory is still 143.1 MB. Free memory was 99.3 MB in the beginning and 90.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.27 ms. Allocated memory is still 143.1 MB. Free memory was 90.1 MB in the beginning and 88.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 507.10 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 88.8 MB in the beginning and 169.0 MB in the end (delta: -80.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26814.49 ms. Allocated memory was 200.8 MB in the beginning and 561.5 MB in the end (delta: 360.7 MB). Free memory was 168.3 MB in the beginning and 331.6 MB in the end (delta: -163.3 MB). Peak memory consumption was 197.4 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: 26.6s, OverallIterations: 16, TraceHistogramMax: 65, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 266 SDtfs, 516 SDslu, 1099 SDs, 0 SdLazy, 1261 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4611 GetRequests, 4264 SyntacticMatches, 124 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 185 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 2576 NumberOfCodeBlocks, 2576 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4525 ConstructedInterpolants, 0 QuantifiedInterpolants, 1820863 SizeOfPredicates, 77 NumberOfNonLiveVariables, 5123 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 57638/71880 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...