/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 SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 22:02:56,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 22:02:56,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 22:02:56,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 22:02:56,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 22:02:56,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 22:02:56,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 22:02:56,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 22:02:56,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 22:02:56,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 22:02:56,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 22:02:56,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 22:02:56,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 22:02:56,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 22:02:56,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 22:02:56,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 22:02:56,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 22:02:56,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 22:02:56,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 22:02:56,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 22:02:56,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 22:02:56,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 22:02:56,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 22:02:56,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 22:02:56,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 22:02:56,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 22:02:56,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 22:02:56,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 22:02:56,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 22:02:56,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 22:02:56,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 22:02:56,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 22:02:56,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 22:02:56,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 22:02:56,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 22:02:56,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 22:02:56,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 22:02:56,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 22:02:56,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 22:02:56,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 22:02:56,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 22:02:56,109 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-21 22:02:56,123 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 22:02:56,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 22:02:56,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 22:02:56,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 22:02:56,124 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 22:02:56,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 22:02:56,125 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 22:02:56,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 22:02:56,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 22:02:56,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 22:02:56,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 22:02:56,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 22:02:56,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 22:02:56,126 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 22:02:56,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 22:02:56,127 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 22:02:56,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 22:02:56,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 22:02:56,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 22:02:56,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 22:02:56,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 22:02:56,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 22:02:56,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 22:02:56,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 22:02:56,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 22:02:56,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 22:02:56,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:02:56,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 22:02:56,129 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 22:02:56,129 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 -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 22:02:56,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 22:02:56,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 22:02:56,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 22:02:56,414 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 22:02:56,414 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 22:02:56,415 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-21 22:02:56,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2325febf4/621da29ffa6a4cb4b985c067b459a180/FLAG43ad1b491 [2020-07-21 22:02:56,890 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 22:02:56,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-21 22:02:56,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2325febf4/621da29ffa6a4cb4b985c067b459a180/FLAG43ad1b491 [2020-07-21 22:02:57,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2325febf4/621da29ffa6a4cb4b985c067b459a180 [2020-07-21 22:02:57,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 22:02:57,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 22:02:57,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 22:02:57,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 22:02:57,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 22:02:57,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:02:57" (1/1) ... [2020-07-21 22:02:57,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7011c986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57, skipping insertion in model container [2020-07-21 22:02:57,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:02:57" (1/1) ... [2020-07-21 22:02:57,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 22:02:57,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 22:02:57,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 22:02:57,578 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 22:02:57,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 22:02:57,613 INFO L208 MainTranslator]: Completed translation [2020-07-21 22:02:57,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57 WrapperNode [2020-07-21 22:02:57,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 22:02:57,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 22:02:57,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 22:02:57,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 22:02:57,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57" (1/1) ... [2020-07-21 22:02:57,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57" (1/1) ... [2020-07-21 22:02:57,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57" (1/1) ... [2020-07-21 22:02:57,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57" (1/1) ... [2020-07-21 22:02:57,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57" (1/1) ... [2020-07-21 22:02:57,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57" (1/1) ... [2020-07-21 22:02:57,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57" (1/1) ... [2020-07-21 22:02:57,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 22:02:57,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 22:02:57,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 22:02:57,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 22:02:57,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57" (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-21 22:02:57,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 22:02:57,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 22:02:57,811 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-21 22:02:57,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 22:02:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 22:02:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 22:02:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-21 22:02:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 22:02:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 22:02:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 22:02:57,976 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 22:02:57,976 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 22:02:57,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:02:57 BoogieIcfgContainer [2020-07-21 22:02:57,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 22:02:57,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 22:02:57,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 22:02:57,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 22:02:57,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:02:57" (1/3) ... [2020-07-21 22:02:57,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e1ae0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:02:57, skipping insertion in model container [2020-07-21 22:02:57,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:02:57" (2/3) ... [2020-07-21 22:02:57,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e1ae0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:02:57, skipping insertion in model container [2020-07-21 22:02:57,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:02:57" (3/3) ... [2020-07-21 22:02:57,987 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-21 22:02:57,997 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 22:02:58,004 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 22:02:58,014 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 22:02:58,035 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 22:02:58,035 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 22:02:58,035 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 22:02:58,035 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 22:02:58,035 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 22:02:58,036 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 22:02:58,036 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 22:02:58,036 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 22:02:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-21 22:02:58,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 22:02:58,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:02:58,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:02:58,060 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:02:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:02:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-21 22:02:58,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:02:58,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644221464] [2020-07-21 22:02:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:02:58,141 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 22:02:58,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:02:58,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 22:02:58,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:02:58,230 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-21 22:02:58,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 22:02:58,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1644221464] [2020-07-21 22:02:58,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 22:02:58,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 22:02:58,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065609969] [2020-07-21 22:02:58,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 22:02:58,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:02:58,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 22:02:58,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 22:02:58,283 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-21 22:02:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:02:58,406 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 22:02:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 22:02:58,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 22:02:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:02:58,417 INFO L225 Difference]: With dead ends: 35 [2020-07-21 22:02:58,418 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 22:02:58,421 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-21 22:02:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 22:02:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 22:02:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 22:02:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 22:02:58,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 22:02:58,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:02:58,460 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 22:02:58,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 22:02:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 22:02:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 22:02:58,462 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:02:58,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:02:58,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:02:58,675 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:02:58,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:02:58,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-21 22:02:58,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:02:58,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1059577456] [2020-07-21 22:02:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:02:58,703 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 22:02:58,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:02:58,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 22:02:58,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:02:58,737 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-21 22:02:58,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 22:02:58,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1059577456] [2020-07-21 22:02:58,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 22:02:58,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 22:02:58,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190428283] [2020-07-21 22:02:58,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 22:02:58,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:02:58,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 22:02:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 22:02:58,742 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 22:02:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:02:58,802 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 22:02:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 22:02:58,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 22:02:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:02:58,805 INFO L225 Difference]: With dead ends: 27 [2020-07-21 22:02:58,805 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 22:02:58,806 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-21 22:02:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 22:02:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 22:02:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 22:02:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 22:02:58,816 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 22:02:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:02:58,816 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 22:02:58,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 22:02:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 22:02:58,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 22:02:58,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:02:58,821 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-21 22:02:59,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:02:59,028 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:02:59,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:02:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-21 22:02:59,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:02:59,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [486992113] [2020-07-21 22:02:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:02:59,060 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:02:59,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:02:59,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 22:02:59,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:02:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 22:02:59,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 22:02:59,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [486992113] [2020-07-21 22:02:59,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 22:02:59,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 22:02:59,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596274625] [2020-07-21 22:02:59,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 22:02:59,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:02:59,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 22:02:59,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-21 22:02:59,128 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-07-21 22:02:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:02:59,242 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-21 22:02:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 22:02:59,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-21 22:02:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:02:59,245 INFO L225 Difference]: With dead ends: 38 [2020-07-21 22:02:59,245 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 22:02:59,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-21 22:02:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 22:02:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-21 22:02:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-21 22:02:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-21 22:02:59,259 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-21 22:02:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:02:59,260 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-21 22:02:59,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 22:02:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-21 22:02:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 22:02:59,264 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:02:59,264 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-21 22:02:59,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:02:59,479 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:02:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:02:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-07-21 22:02:59,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:02:59,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1822967027] [2020-07-21 22:02:59,482 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:02:59,513 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 22:02:59,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:02:59,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 22:02:59,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:02:59,564 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-21 22:02:59,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:02:59,737 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:02:59,740 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:02:59,767 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-21 22:02:59,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1822967027] [2020-07-21 22:02:59,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:02:59,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-07-21 22:02:59,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934992886] [2020-07-21 22:02:59,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-21 22:02:59,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:02:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-21 22:02:59,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-21 22:02:59,770 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2020-07-21 22:02:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:02:59,880 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2020-07-21 22:02:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 22:02:59,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-21 22:02:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:02:59,883 INFO L225 Difference]: With dead ends: 39 [2020-07-21 22:02:59,883 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 22:02:59,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-07-21 22:02:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 22:02:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-21 22:02:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-21 22:02:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2020-07-21 22:02:59,895 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 27 [2020-07-21 22:02:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:02:59,895 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2020-07-21 22:02:59,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-21 22:02:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2020-07-21 22:02:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-21 22:02:59,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:02:59,899 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:00,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:00,113 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:00,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:00,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1317930072, now seen corresponding path program 2 times [2020-07-21 22:03:00,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:00,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1183076842] [2020-07-21 22:03:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:03:00,163 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:03:00,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:00,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 22:03:00,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 221 proven. 13 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-07-21 22:03:00,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:00,687 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 58 proven. 126 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2020-07-21 22:03:00,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1183076842] [2020-07-21 22:03:00,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:00,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2020-07-21 22:03:00,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822964470] [2020-07-21 22:03:00,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 22:03:00,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:00,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 22:03:00,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-21 22:03:00,726 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 11 states. [2020-07-21 22:03:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:00,859 INFO L93 Difference]: Finished difference Result 65 states and 113 transitions. [2020-07-21 22:03:00,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 22:03:00,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-07-21 22:03:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:00,862 INFO L225 Difference]: With dead ends: 65 [2020-07-21 22:03:00,862 INFO L226 Difference]: Without dead ends: 38 [2020-07-21 22:03:00,863 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 169 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-07-21 22:03:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-21 22:03:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2020-07-21 22:03:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-21 22:03:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2020-07-21 22:03:00,873 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 93 [2020-07-21 22:03:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:00,873 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2020-07-21 22:03:00,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 22:03:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2020-07-21 22:03:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 22:03:00,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:00,877 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-21 22:03:01,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:01,091 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2020-07-21 22:03:01,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:01,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374722167] [2020-07-21 22:03:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:03:01,141 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 22:03:01,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:01,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 22:03:01,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 106 proven. 170 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-07-21 22:03:01,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:01,750 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:01,751 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:01,811 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:01,814 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:02,068 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:02,138 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:02,139 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 106 proven. 182 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-07-21 22:03:02,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374722167] [2020-07-21 22:03:02,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:02,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 17 [2020-07-21 22:03:02,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245815854] [2020-07-21 22:03:02,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 22:03:02,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 22:03:02,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-21 22:03:02,189 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 17 states. [2020-07-21 22:03:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:02,633 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2020-07-21 22:03:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-21 22:03:02,633 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2020-07-21 22:03:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:02,635 INFO L225 Difference]: With dead ends: 78 [2020-07-21 22:03:02,635 INFO L226 Difference]: Without dead ends: 49 [2020-07-21 22:03:02,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 167 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2020-07-21 22:03:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-21 22:03:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-21 22:03:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-21 22:03:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2020-07-21 22:03:02,647 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 96 [2020-07-21 22:03:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:02,648 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2020-07-21 22:03:02,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 22:03:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2020-07-21 22:03:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-21 22:03:02,650 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:02,650 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:02,865 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:02,866 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:02,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:02,867 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 4 times [2020-07-21 22:03:02,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:02,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [944897961] [2020-07-21 22:03:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:03:02,934 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 22:03:02,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:02,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 22:03:02,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-07-21 22:03:03,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:03,601 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:03,602 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:03,745 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:03,746 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:03,827 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:03,828 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:03,876 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:03,878 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 255 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-07-21 22:03:03,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [944897961] [2020-07-21 22:03:03,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:03,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 16 [2020-07-21 22:03:03,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157196232] [2020-07-21 22:03:03,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 22:03:03,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:03,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 22:03:03,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2020-07-21 22:03:03,932 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand 16 states. [2020-07-21 22:03:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:04,152 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2020-07-21 22:03:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 22:03:04,153 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2020-07-21 22:03:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:04,156 INFO L225 Difference]: With dead ends: 65 [2020-07-21 22:03:04,156 INFO L226 Difference]: Without dead ends: 59 [2020-07-21 22:03:04,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 194 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2020-07-21 22:03:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-21 22:03:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-21 22:03:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-21 22:03:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2020-07-21 22:03:04,168 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 109 [2020-07-21 22:03:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:04,169 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2020-07-21 22:03:04,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 22:03:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2020-07-21 22:03:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2020-07-21 22:03:04,179 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:04,180 INFO L422 BasicCegarLoop]: trace histogram [71, 71, 57, 35, 35, 35, 35, 35, 35, 35, 22, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:04,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:04,395 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:04,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:04,395 INFO L82 PathProgramCache]: Analyzing trace with hash 51219549, now seen corresponding path program 5 times [2020-07-21 22:03:04,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:04,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [326292878] [2020-07-21 22:03:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:03:04,501 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:03:04,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:04,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 22:03:04,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13916 backedges. 6226 proven. 418 refuted. 0 times theorem prover too weak. 7272 trivial. 0 not checked. [2020-07-21 22:03:04,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:07,016 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,017 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,125 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,126 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,193 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,194 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,558 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,672 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,675 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,736 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13916 backedges. 596 proven. 2877 refuted. 0 times theorem prover too weak. 10443 trivial. 0 not checked. [2020-07-21 22:03:07,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [326292878] [2020-07-21 22:03:07,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:07,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 21 [2020-07-21 22:03:07,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025933213] [2020-07-21 22:03:07,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 22:03:07,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:07,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 22:03:07,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-21 22:03:07,997 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand 21 states. [2020-07-21 22:03:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:08,493 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2020-07-21 22:03:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-21 22:03:08,494 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 490 [2020-07-21 22:03:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:08,497 INFO L225 Difference]: With dead ends: 124 [2020-07-21 22:03:08,497 INFO L226 Difference]: Without dead ends: 73 [2020-07-21 22:03:08,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 995 GetRequests, 943 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2020-07-21 22:03:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-21 22:03:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2020-07-21 22:03:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-21 22:03:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2020-07-21 22:03:08,510 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 490 [2020-07-21 22:03:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:08,511 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2020-07-21 22:03:08,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 22:03:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2020-07-21 22:03:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2020-07-21 22:03:08,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:08,518 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:08,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:08,732 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1242507885, now seen corresponding path program 6 times [2020-07-21 22:03:08,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:08,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435308636] [2020-07-21 22:03:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:03:08,869 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 22:03:08,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:08,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 22:03:08,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 984 proven. 1855 refuted. 0 times theorem prover too weak. 4281 trivial. 0 not checked. [2020-07-21 22:03:09,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:10,899 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:11,158 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:11,309 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:11,310 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:11,396 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:11,397 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:11,448 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:11,449 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:12,363 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:12,616 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:12,616 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:12,788 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:12,789 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:12,879 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:12,928 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 984 proven. 1930 refuted. 0 times theorem prover too weak. 4206 trivial. 0 not checked. [2020-07-21 22:03:13,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435308636] [2020-07-21 22:03:13,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:13,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 29 [2020-07-21 22:03:13,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850215080] [2020-07-21 22:03:13,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-21 22:03:13,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-21 22:03:13,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2020-07-21 22:03:13,026 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand 29 states. [2020-07-21 22:03:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:13,996 INFO L93 Difference]: Finished difference Result 173 states and 311 transitions. [2020-07-21 22:03:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-21 22:03:13,997 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 354 [2020-07-21 22:03:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:14,003 INFO L225 Difference]: With dead ends: 173 [2020-07-21 22:03:14,003 INFO L226 Difference]: Without dead ends: 112 [2020-07-21 22:03:14,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 655 SyntacticMatches, 25 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=747, Invalid=2223, Unknown=0, NotChecked=0, Total=2970 [2020-07-21 22:03:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-21 22:03:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2020-07-21 22:03:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-21 22:03:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2020-07-21 22:03:14,026 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 354 [2020-07-21 22:03:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:14,027 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2020-07-21 22:03:14,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-21 22:03:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2020-07-21 22:03:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2020-07-21 22:03:14,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:14,032 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:14,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:14,235 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1052494023, now seen corresponding path program 7 times [2020-07-21 22:03:14,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:14,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1403456961] [2020-07-21 22:03:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:03:14,447 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 22:03:14,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:14,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-21 22:03:14,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1969 proven. 3803 refuted. 0 times theorem prover too weak. 13331 trivial. 0 not checked. [2020-07-21 22:03:14,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:17,420 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:17,421 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:17,846 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:18,157 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:18,362 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:18,467 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:18,468 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:18,520 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:19,957 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:20,383 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:20,640 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:20,801 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:20,802 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:20,900 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:20,901 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:20,971 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1969 proven. 3911 refuted. 0 times theorem prover too weak. 13223 trivial. 0 not checked. [2020-07-21 22:03:21,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1403456961] [2020-07-21 22:03:21,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:21,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31] total 33 [2020-07-21 22:03:21,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052667980] [2020-07-21 22:03:21,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-21 22:03:21,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-21 22:03:21,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2020-07-21 22:03:21,173 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand 33 states. [2020-07-21 22:03:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:22,507 INFO L93 Difference]: Finished difference Result 220 states and 368 transitions. [2020-07-21 22:03:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-21 22:03:22,507 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 572 [2020-07-21 22:03:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:22,511 INFO L225 Difference]: With dead ends: 220 [2020-07-21 22:03:22,511 INFO L226 Difference]: Without dead ends: 130 [2020-07-21 22:03:22,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1083 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=987, Invalid=3045, Unknown=0, NotChecked=0, Total=4032 [2020-07-21 22:03:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-21 22:03:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2020-07-21 22:03:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-21 22:03:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2020-07-21 22:03:22,536 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 572 [2020-07-21 22:03:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:22,537 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2020-07-21 22:03:22,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-21 22:03:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2020-07-21 22:03:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-21 22:03:22,540 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:22,540 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:22,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:22,744 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 8 times [2020-07-21 22:03:22,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:22,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113173898] [2020-07-21 22:03:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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-21 22:03:23,001 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 22:03:23,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 22:03:23,001 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 22:03:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 22:03:23,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 22:03:23,153 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 22:03:23,153 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 22:03:23,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:23,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 10:03:23 BoogieIcfgContainer [2020-07-21 22:03:23,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 22:03:23,454 INFO L168 Benchmark]: Toolchain (without parser) took 26151.72 ms. Allocated memory was 145.2 MB in the beginning and 542.1 MB in the end (delta: 396.9 MB). Free memory was 101.4 MB in the beginning and 327.0 MB in the end (delta: -225.6 MB). Peak memory consumption was 171.3 MB. Max. memory is 7.1 GB. [2020-07-21 22:03:23,455 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 119.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 22:03:23,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.64 ms. Allocated memory is still 145.2 MB. Free memory was 101.2 MB in the beginning and 91.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-21 22:03:23,457 INFO L168 Benchmark]: Boogie Preprocessor took 34.22 ms. Allocated memory is still 145.2 MB. Free memory was 91.8 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 22:03:23,458 INFO L168 Benchmark]: RCFGBuilder took 328.96 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 90.5 MB in the beginning and 170.5 MB in the end (delta: -80.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-21 22:03:23,458 INFO L168 Benchmark]: TraceAbstraction took 25471.19 ms. Allocated memory was 203.4 MB in the beginning and 542.1 MB in the end (delta: 338.7 MB). Free memory was 170.5 MB in the beginning and 327.0 MB in the end (delta: -156.5 MB). Peak memory consumption was 182.2 MB. Max. memory is 7.1 GB. [2020-07-21 22:03:23,462 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 119.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 306.64 ms. Allocated memory is still 145.2 MB. Free memory was 101.2 MB in the beginning and 91.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.22 ms. Allocated memory is still 145.2 MB. Free memory was 91.8 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 328.96 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 90.5 MB in the beginning and 170.5 MB in the end (delta: -80.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25471.19 ms. Allocated memory was 203.4 MB in the beginning and 542.1 MB in the end (delta: 338.7 MB). Free memory was 170.5 MB in the beginning and 327.0 MB in the end (delta: -156.5 MB). Peak memory consumption was 182.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.3s, OverallIterations: 11, TraceHistogramMax: 83, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 226 SDtfs, 1124 SDslu, 837 SDs, 0 SdLazy, 1487 SolverSat, 1475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3636 GetRequests, 3296 SyntacticMatches, 103 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 2257 NumberOfCodeBlocks, 1578 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3518 ConstructedInterpolants, 0 QuantifiedInterpolants, 2163709 SizeOfPredicates, 70 NumberOfNonLiveVariables, 2504 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 67327/83110 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...