/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 21:53:15,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 21:53:15,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 21:53:15,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 21:53:15,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 21:53:15,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 21:53:15,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 21:53:15,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 21:53:15,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 21:53:15,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 21:53:15,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 21:53:15,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 21:53:15,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 21:53:15,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 21:53:15,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 21:53:15,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 21:53:15,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 21:53:15,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 21:53:15,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 21:53:15,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 21:53:15,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 21:53:15,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 21:53:15,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 21:53:15,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 21:53:15,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 21:53:15,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 21:53:15,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 21:53:15,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 21:53:15,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 21:53:15,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 21:53:15,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 21:53:15,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 21:53:15,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 21:53:15,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 21:53:15,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 21:53:15,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 21:53:15,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 21:53:15,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 21:53:15,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 21:53:15,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 21:53:15,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 21:53:15,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 21:53:15,112 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 21:53:15,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 21:53:15,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 21:53:15,114 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 21:53:15,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 21:53:15,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 21:53:15,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 21:53:15,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 21:53:15,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 21:53:15,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 21:53:15,115 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 21:53:15,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 21:53:15,115 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 21:53:15,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 21:53:15,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 21:53:15,116 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 21:53:15,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 21:53:15,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 21:53:15,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 21:53:15,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 21:53:15,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 21:53:15,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 21:53:15,117 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 21:53:15,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 21:53:15,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 21:53:15,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 21:53:15,379 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 21:53:15,380 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 21:53:15,380 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 21:53:15,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6448d6abf/bde181178a884ff19f29f7184ed1d547/FLAG39224baad [2020-08-22 21:53:15,822 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 21:53:15,822 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 21:53:15,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6448d6abf/bde181178a884ff19f29f7184ed1d547/FLAG39224baad [2020-08-22 21:53:16,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6448d6abf/bde181178a884ff19f29f7184ed1d547 [2020-08-22 21:53:16,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 21:53:16,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 21:53:16,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 21:53:16,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 21:53:16,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 21:53:16,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:53:16" (1/1) ... [2020-08-22 21:53:16,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325abad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16, skipping insertion in model container [2020-08-22 21:53:16,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:53:16" (1/1) ... [2020-08-22 21:53:16,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 21:53:16,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 21:53:16,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:53:16,436 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 21:53:16,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:53:16,472 INFO L208 MainTranslator]: Completed translation [2020-08-22 21:53:16,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16 WrapperNode [2020-08-22 21:53:16,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 21:53:16,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 21:53:16,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 21:53:16,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 21:53:16,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16" (1/1) ... [2020-08-22 21:53:16,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16" (1/1) ... [2020-08-22 21:53:16,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16" (1/1) ... [2020-08-22 21:53:16,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16" (1/1) ... [2020-08-22 21:53:16,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16" (1/1) ... [2020-08-22 21:53:16,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16" (1/1) ... [2020-08-22 21:53:16,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16" (1/1) ... [2020-08-22 21:53:16,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 21:53:16,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 21:53:16,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 21:53:16,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 21:53:16,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16" (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-08-22 21:53:16,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 21:53:16,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 21:53:16,664 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-22 21:53:16,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 21:53:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 21:53:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 21:53:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-22 21:53:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 21:53:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 21:53:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 21:53:16,863 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 21:53:16,863 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 21:53:16,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:53:16 BoogieIcfgContainer [2020-08-22 21:53:16,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 21:53:16,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 21:53:16,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 21:53:16,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 21:53:16,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 09:53:16" (1/3) ... [2020-08-22 21:53:16,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d04419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:53:16, skipping insertion in model container [2020-08-22 21:53:16,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:53:16" (2/3) ... [2020-08-22 21:53:16,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d04419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:53:16, skipping insertion in model container [2020-08-22 21:53:16,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:53:16" (3/3) ... [2020-08-22 21:53:16,878 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-22 21:53:16,889 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 21:53:16,896 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 21:53:16,911 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 21:53:16,938 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 21:53:16,938 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 21:53:16,938 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 21:53:16,939 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 21:53:16,939 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 21:53:16,939 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 21:53:16,939 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 21:53:16,939 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 21:53:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-08-22 21:53:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-08-22 21:53:16,988 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:16,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:16,989 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-08-22 21:53:17,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:17,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [843563593] [2020-08-22 21:53:17,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 21:53:17,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [843563593] [2020-08-22 21:53:17,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 21:53:17,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 21:53:17,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573785173] [2020-08-22 21:53:17,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 21:53:17,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:17,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 21:53:17,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 21:53:17,255 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-08-22 21:53:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:17,383 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-08-22 21:53:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 21:53:17,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-08-22 21:53:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:17,395 INFO L225 Difference]: With dead ends: 48 [2020-08-22 21:53:17,395 INFO L226 Difference]: Without dead ends: 30 [2020-08-22 21:53:17,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:53:17,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-22 21:53:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-22 21:53:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-22 21:53:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-08-22 21:53:17,444 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-08-22 21:53:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:17,445 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-08-22 21:53:17,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 21:53:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-08-22 21:53:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-22 21:53:17,448 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:17,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:17,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 21:53:17,449 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-08-22 21:53:17,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:17,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1429515550] [2020-08-22 21:53:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 21:53:17,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1429515550] [2020-08-22 21:53:17,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 21:53:17,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 21:53:17,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779821649] [2020-08-22 21:53:17,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 21:53:17,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 21:53:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 21:53:17,524 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-08-22 21:53:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:17,587 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-08-22 21:53:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 21:53:17,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-08-22 21:53:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:17,589 INFO L225 Difference]: With dead ends: 38 [2020-08-22 21:53:17,590 INFO L226 Difference]: Without dead ends: 32 [2020-08-22 21:53:17,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:53:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-08-22 21:53:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-08-22 21:53:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-22 21:53:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-08-22 21:53:17,603 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-08-22 21:53:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:17,603 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-08-22 21:53:17,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 21:53:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-08-22 21:53:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-08-22 21:53:17,605 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:17,606 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:17,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 21:53:17,606 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:17,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:17,607 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-08-22 21:53:17,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:17,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [201290113] [2020-08-22 21:53:17,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 21:53:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 21:53:17,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [201290113] [2020-08-22 21:53:17,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:17,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 21:53:17,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973945183] [2020-08-22 21:53:17,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 21:53:17,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 21:53:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:53:17,738 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-08-22 21:53:17,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:17,825 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-08-22 21:53:17,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 21:53:17,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-08-22 21:53:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:17,828 INFO L225 Difference]: With dead ends: 54 [2020-08-22 21:53:17,828 INFO L226 Difference]: Without dead ends: 32 [2020-08-22 21:53:17,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 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-08-22 21:53:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-08-22 21:53:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-08-22 21:53:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-08-22 21:53:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-08-22 21:53:17,841 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-08-22 21:53:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:17,841 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-08-22 21:53:17,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 21:53:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-08-22 21:53:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-08-22 21:53:17,844 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:17,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:17,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 21:53:17,845 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-08-22 21:53:17,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:17,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [670714323] [2020-08-22 21:53:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 21:53:17,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [670714323] [2020-08-22 21:53:17,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:17,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 21:53:17,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488354498] [2020-08-22 21:53:17,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 21:53:17,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:17,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 21:53:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:53:17,958 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2020-08-22 21:53:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:18,082 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-08-22 21:53:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 21:53:18,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-08-22 21:53:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:18,085 INFO L225 Difference]: With dead ends: 58 [2020-08-22 21:53:18,085 INFO L226 Difference]: Without dead ends: 52 [2020-08-22 21:53:18,086 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-22 21:53:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-08-22 21:53:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-08-22 21:53:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-08-22 21:53:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-08-22 21:53:18,102 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-08-22 21:53:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:18,103 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-08-22 21:53:18,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 21:53:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-08-22 21:53:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-08-22 21:53:18,106 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:18,106 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:18,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 21:53:18,106 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:18,107 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-08-22 21:53:18,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:18,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137932751] [2020-08-22 21:53:18,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 21:53:18,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137932751] [2020-08-22 21:53:18,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:18,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 21:53:18,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770862301] [2020-08-22 21:53:18,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 21:53:18,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 21:53:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:53:18,244 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 7 states. [2020-08-22 21:53:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:18,361 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-08-22 21:53:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 21:53:18,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-08-22 21:53:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:18,364 INFO L225 Difference]: With dead ends: 110 [2020-08-22 21:53:18,364 INFO L226 Difference]: Without dead ends: 66 [2020-08-22 21:53:18,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 21:53:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-22 21:53:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-08-22 21:53:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-22 21:53:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-08-22 21:53:18,381 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-08-22 21:53:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:18,382 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-08-22 21:53:18,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 21:53:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-08-22 21:53:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-22 21:53:18,384 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:18,385 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:18,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 21:53:18,385 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:18,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-08-22 21:53:18,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:18,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687572188] [2020-08-22 21:53:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 21:53:18,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687572188] [2020-08-22 21:53:18,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:18,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 21:53:18,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465684250] [2020-08-22 21:53:18,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 21:53:18,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:18,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 21:53:18,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:53:18,544 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 7 states. [2020-08-22 21:53:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:18,677 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-08-22 21:53:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 21:53:18,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-08-22 21:53:18,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:18,680 INFO L225 Difference]: With dead ends: 88 [2020-08-22 21:53:18,680 INFO L226 Difference]: Without dead ends: 82 [2020-08-22 21:53:18,681 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 21:53:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-08-22 21:53:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-08-22 21:53:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-22 21:53:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-08-22 21:53:18,697 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-08-22 21:53:18,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:18,698 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-08-22 21:53:18,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 21:53:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-08-22 21:53:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-08-22 21:53:18,703 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:18,703 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:18,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 21:53:18,703 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-08-22 21:53:18,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:18,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [729351661] [2020-08-22 21:53:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:18,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-08-22 21:53:19,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [729351661] [2020-08-22 21:53:19,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:19,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 21:53:19,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937375118] [2020-08-22 21:53:19,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 21:53:19,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:19,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 21:53:19,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 21:53:19,035 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 10 states. [2020-08-22 21:53:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:19,302 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2020-08-22 21:53:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 21:53:19,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-08-22 21:53:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:19,305 INFO L225 Difference]: With dead ends: 139 [2020-08-22 21:53:19,305 INFO L226 Difference]: Without dead ends: 70 [2020-08-22 21:53:19,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-08-22 21:53:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-22 21:53:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-08-22 21:53:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-22 21:53:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-08-22 21:53:19,319 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 125 [2020-08-22 21:53:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:19,319 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-08-22 21:53:19,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 21:53:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-08-22 21:53:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-08-22 21:53:19,321 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:19,321 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:19,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 21:53:19,322 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:19,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-08-22 21:53:19,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:19,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [454597183] [2020-08-22 21:53:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 105 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-08-22 21:53:19,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [454597183] [2020-08-22 21:53:19,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:19,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 21:53:19,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746978562] [2020-08-22 21:53:19,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 21:53:19,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:19,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 21:53:19,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-22 21:53:19,481 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-08-22 21:53:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:19,609 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-08-22 21:53:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 21:53:19,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-08-22 21:53:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:19,611 INFO L225 Difference]: With dead ends: 73 [2020-08-22 21:53:19,611 INFO L226 Difference]: Without dead ends: 67 [2020-08-22 21:53:19,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-22 21:53:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-08-22 21:53:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-08-22 21:53:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-08-22 21:53:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2020-08-22 21:53:19,624 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 89 [2020-08-22 21:53:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:19,624 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2020-08-22 21:53:19,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 21:53:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-08-22 21:53:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-08-22 21:53:19,626 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:19,626 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:19,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 21:53:19,627 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-08-22 21:53:19,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:19,628 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [747655529] [2020-08-22 21:53:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:53:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:19,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:53:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 78 proven. 452 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2020-08-22 21:53:20,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [747655529] [2020-08-22 21:53:20,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:20,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 21:53:20,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664845869] [2020-08-22 21:53:20,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 21:53:20,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:20,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 21:53:20,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-22 21:53:20,028 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 9 states. [2020-08-22 21:53:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:20,208 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2020-08-22 21:53:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 21:53:20,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2020-08-22 21:53:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:20,212 INFO L225 Difference]: With dead ends: 169 [2020-08-22 21:53:20,212 INFO L226 Difference]: Without dead ends: 163 [2020-08-22 21:53:20,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-22 21:53:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-08-22 21:53:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2020-08-22 21:53:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-08-22 21:53:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 194 transitions. [2020-08-22 21:53:20,236 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 194 transitions. Word has length 195 [2020-08-22 21:53:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:20,237 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 194 transitions. [2020-08-22 21:53:20,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 21:53:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 194 transitions. [2020-08-22 21:53:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-08-22 21:53:20,240 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:20,240 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:20,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 21:53:20,240 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:20,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:20,241 INFO L82 PathProgramCache]: Analyzing trace with hash 764562375, now seen corresponding path program 7 times [2020-08-22 21:53:20,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:20,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1648471389] [2020-08-22 21:53:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:53:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:53:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:53:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 536 proven. 797 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2020-08-22 21:53:20,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1648471389] [2020-08-22 21:53:20,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:20,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-22 21:53:20,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026243813] [2020-08-22 21:53:20,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 21:53:20,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:20,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 21:53:20,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-08-22 21:53:20,835 INFO L87 Difference]: Start difference. First operand 145 states and 194 transitions. Second operand 14 states. [2020-08-22 21:53:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:21,359 INFO L93 Difference]: Finished difference Result 251 states and 382 transitions. [2020-08-22 21:53:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-08-22 21:53:21,360 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 265 [2020-08-22 21:53:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:21,362 INFO L225 Difference]: With dead ends: 251 [2020-08-22 21:53:21,362 INFO L226 Difference]: Without dead ends: 116 [2020-08-22 21:53:21,364 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2020-08-22 21:53:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-08-22 21:53:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2020-08-22 21:53:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-08-22 21:53:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2020-08-22 21:53:21,380 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 265 [2020-08-22 21:53:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:21,380 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2020-08-22 21:53:21,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 21:53:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2020-08-22 21:53:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-08-22 21:53:21,384 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:21,384 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:21,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 21:53:21,385 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:21,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:21,393 INFO L82 PathProgramCache]: Analyzing trace with hash -753564480, now seen corresponding path program 8 times [2020-08-22 21:53:21,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:21,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091428013] [2020-08-22 21:53:21,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:53:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:53:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 126 proven. 642 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2020-08-22 21:53:21,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091428013] [2020-08-22 21:53:21,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:21,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 21:53:21,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041184154] [2020-08-22 21:53:21,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 21:53:21,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:21,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 21:53:21,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 21:53:21,775 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand 10 states. [2020-08-22 21:53:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:21,964 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2020-08-22 21:53:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 21:53:21,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2020-08-22 21:53:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:21,966 INFO L225 Difference]: With dead ends: 111 [2020-08-22 21:53:21,966 INFO L226 Difference]: Without dead ends: 105 [2020-08-22 21:53:21,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-22 21:53:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-08-22 21:53:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-08-22 21:53:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-08-22 21:53:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2020-08-22 21:53:21,980 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 230 [2020-08-22 21:53:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:21,981 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2020-08-22 21:53:21,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 21:53:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2020-08-22 21:53:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2020-08-22 21:53:21,991 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:21,992 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:21,992 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 21:53:21,993 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:21,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1790891897, now seen corresponding path program 9 times [2020-08-22 21:53:21,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:21,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [290963786] [2020-08-22 21:53:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:53:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 21:53:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:53:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 21:53:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 21:53:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:53:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 21:53:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:53:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:53:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:53:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:53:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 264 proven. 1364 refuted. 0 times theorem prover too weak. 3616 trivial. 0 not checked. [2020-08-22 21:53:22,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [290963786] [2020-08-22 21:53:22,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:53:22,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 21:53:22,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207412248] [2020-08-22 21:53:22,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 21:53:22,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:53:22,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 21:53:22,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-22 21:53:22,794 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 11 states. [2020-08-22 21:53:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:53:23,071 INFO L93 Difference]: Finished difference Result 352 states and 478 transitions. [2020-08-22 21:53:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 21:53:23,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 371 [2020-08-22 21:53:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:53:23,078 INFO L225 Difference]: With dead ends: 352 [2020-08-22 21:53:23,078 INFO L226 Difference]: Without dead ends: 346 [2020-08-22 21:53:23,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-22 21:53:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-08-22 21:53:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 316. [2020-08-22 21:53:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-08-22 21:53:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 433 transitions. [2020-08-22 21:53:23,137 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 433 transitions. Word has length 371 [2020-08-22 21:53:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:53:23,139 INFO L479 AbstractCegarLoop]: Abstraction has 316 states and 433 transitions. [2020-08-22 21:53:23,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 21:53:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 433 transitions. [2020-08-22 21:53:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2020-08-22 21:53:23,154 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:53:23,154 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:53:23,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 21:53:23,155 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:53:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:53:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash -170434367, now seen corresponding path program 10 times [2020-08-22 21:53:23,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:53:23,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [765013439] [2020-08-22 21:53:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:53:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 21:53:23,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 21:53:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 21:53:23,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 21:53:23,574 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 21:53:23,574 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 21:53:23,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 21:53:23,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 09:53:23 BoogieIcfgContainer [2020-08-22 21:53:23,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 21:53:23,713 INFO L168 Benchmark]: Toolchain (without parser) took 7480.28 ms. Allocated memory was 138.4 MB in the beginning and 433.1 MB in the end (delta: 294.6 MB). Free memory was 101.5 MB in the beginning and 235.6 MB in the end (delta: -134.0 MB). Peak memory consumption was 160.6 MB. Max. memory is 7.1 GB. [2020-08-22 21:53:23,714 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 21:53:23,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.49 ms. Allocated memory is still 138.4 MB. Free memory was 101.3 MB in the beginning and 91.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-08-22 21:53:23,716 INFO L168 Benchmark]: Boogie Preprocessor took 30.02 ms. Allocated memory is still 138.4 MB. Free memory was 91.9 MB in the beginning and 90.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-22 21:53:23,716 INFO L168 Benchmark]: RCFGBuilder took 364.00 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 90.4 MB in the beginning and 168.7 MB in the end (delta: -78.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-08-22 21:53:23,722 INFO L168 Benchmark]: TraceAbstraction took 6839.01 ms. Allocated memory was 201.9 MB in the beginning and 433.1 MB in the end (delta: 231.2 MB). Free memory was 168.0 MB in the beginning and 235.6 MB in the end (delta: -67.5 MB). Peak memory consumption was 163.7 MB. Max. memory is 7.1 GB. [2020-08-22 21:53:23,728 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.19 ms. Allocated memory is still 138.4 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 242.49 ms. Allocated memory is still 138.4 MB. Free memory was 101.3 MB in the beginning and 91.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.02 ms. Allocated memory is still 138.4 MB. Free memory was 91.9 MB in the beginning and 90.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 364.00 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 90.4 MB in the beginning and 168.7 MB in the end (delta: -78.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6839.01 ms. Allocated memory was 201.9 MB in the beginning and 433.1 MB in the end (delta: 231.2 MB). Free memory was 168.0 MB in the beginning and 235.6 MB in the end (delta: -67.5 MB). Peak memory consumption was 163.7 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(); VAL [__VERIFIER_nondet_int()=8, x=8] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [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); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [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); VAL [\old(n)=6, \result=8, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [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); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [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); VAL [\old(n)=7, \result=13, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [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); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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 VAL [\old(n)=1, 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); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [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 VAL [\old(n)=1, 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 VAL [\old(n)=0, n=0] [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); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, 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); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [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); VAL [\old(n)=6, \result=8, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [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); VAL [\old(n)=8, \result=21, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); VAL [fibonacci(x)=21, result=21, x=8] [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, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.6s, OverallIterations: 13, TraceHistogramMax: 67, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 370 SDtfs, 631 SDslu, 1058 SDs, 0 SdLazy, 1048 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 94 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2090 NumberOfCodeBlocks, 2090 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1478 ConstructedInterpolants, 0 QuantifiedInterpolants, 515326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 8261/11842 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...