/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-simple/fibo_2calls_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 22:07:01,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 22:07:01,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 22:07:01,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 22:07:01,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 22:07:01,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 22:07:01,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 22:07:01,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 22:07:01,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 22:07:01,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 22:07:01,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 22:07:01,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 22:07:01,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 22:07:01,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 22:07:01,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 22:07:01,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 22:07:01,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 22:07:01,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 22:07:01,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 22:07:01,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 22:07:01,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 22:07:01,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 22:07:01,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 22:07:01,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 22:07:01,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 22:07:01,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 22:07:01,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 22:07:01,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 22:07:01,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 22:07:01,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 22:07:01,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 22:07:01,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 22:07:01,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 22:07:01,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 22:07:01,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 22:07:01,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 22:07:01,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 22:07:01,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 22:07:01,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 22:07:01,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 22:07:01,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 22:07:01,986 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 22:07:01,996 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 22:07:01,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 22:07:01,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 22:07:01,998 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 22:07:01,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 22:07:01,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 22:07:01,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 22:07:01,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 22:07:01,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 22:07:01,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 22:07:01,999 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 22:07:01,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 22:07:01,999 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 22:07:02,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 22:07:02,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 22:07:02,000 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 22:07:02,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 22:07:02,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 22:07:02,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:07:02,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 22:07:02,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 22:07:02,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 22:07:02,001 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 22:07:02,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 22:07:02,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 22:07:02,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 22:07:02,308 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 22:07:02,308 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 22:07:02,309 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-08-22 22:07:02,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fe1a0a1/c183d516f2e14609b8fcaa35e9884ec9/FLAGeeb0236a8 [2020-08-22 22:07:02,889 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 22:07:02,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-08-22 22:07:02,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fe1a0a1/c183d516f2e14609b8fcaa35e9884ec9/FLAGeeb0236a8 [2020-08-22 22:07:03,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fe1a0a1/c183d516f2e14609b8fcaa35e9884ec9 [2020-08-22 22:07:03,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 22:07:03,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 22:07:03,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 22:07:03,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 22:07:03,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 22:07:03,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:07:03" (1/1) ... [2020-08-22 22:07:03,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e660cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03, skipping insertion in model container [2020-08-22 22:07:03,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:07:03" (1/1) ... [2020-08-22 22:07:03,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 22:07:03,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 22:07:03,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:07:03,494 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 22:07:03,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:07:03,526 INFO L208 MainTranslator]: Completed translation [2020-08-22 22:07:03,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03 WrapperNode [2020-08-22 22:07:03,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 22:07:03,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 22:07:03,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 22:07:03,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 22:07:03,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03" (1/1) ... [2020-08-22 22:07:03,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03" (1/1) ... [2020-08-22 22:07:03,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03" (1/1) ... [2020-08-22 22:07:03,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03" (1/1) ... [2020-08-22 22:07:03,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03" (1/1) ... [2020-08-22 22:07:03,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03" (1/1) ... [2020-08-22 22:07:03,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03" (1/1) ... [2020-08-22 22:07:03,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 22:07:03,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 22:07:03,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 22:07:03,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 22:07:03,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03" (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 22:07:03,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 22:07:03,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 22:07:03,702 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-08-22 22:07:03,703 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-08-22 22:07:03,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 22:07:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 22:07:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 22:07:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-08-22 22:07:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-08-22 22:07:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 22:07:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 22:07:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 22:07:03,910 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 22:07:03,910 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 22:07:03,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:07:03 BoogieIcfgContainer [2020-08-22 22:07:03,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 22:07:03,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 22:07:03,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 22:07:03,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 22:07:03,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 10:07:03" (1/3) ... [2020-08-22 22:07:03,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733309df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:07:03, skipping insertion in model container [2020-08-22 22:07:03,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:07:03" (2/3) ... [2020-08-22 22:07:03,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733309df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:07:03, skipping insertion in model container [2020-08-22 22:07:03,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:07:03" (3/3) ... [2020-08-22 22:07:03,925 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2020-08-22 22:07:03,936 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 22:07:03,946 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 22:07:03,961 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 22:07:03,986 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 22:07:03,987 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 22:07:03,987 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 22:07:03,987 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 22:07:03,987 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 22:07:03,988 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 22:07:03,988 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 22:07:03,988 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 22:07:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-08-22 22:07:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-08-22 22:07:04,035 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:04,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:04,036 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-08-22 22:07:04,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:04,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1517892964] [2020-08-22 22:07:04,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,258 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 22:07:04,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1517892964] [2020-08-22 22:07:04,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:07:04,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 22:07:04,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266421203] [2020-08-22 22:07:04,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 22:07:04,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:04,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 22:07:04,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 22:07:04,284 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-08-22 22:07:04,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:04,388 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-08-22 22:07:04,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 22:07:04,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-08-22 22:07:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:04,402 INFO L225 Difference]: With dead ends: 58 [2020-08-22 22:07:04,402 INFO L226 Difference]: Without dead ends: 42 [2020-08-22 22:07:04,406 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 22:07:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-22 22:07:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-22 22:07:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 22:07:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 22:07:04,458 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-08-22 22:07:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:04,459 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 22:07:04,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 22:07:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 22:07:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-08-22 22:07:04,461 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:04,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:04,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 22:07:04,463 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-08-22 22:07:04,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:04,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1267440511] [2020-08-22 22:07:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,543 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 22:07:04,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1267440511] [2020-08-22 22:07:04,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:07:04,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 22:07:04,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760937702] [2020-08-22 22:07:04,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 22:07:04,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:04,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 22:07:04,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 22:07:04,548 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-08-22 22:07:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:04,627 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-08-22 22:07:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 22:07:04,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-08-22 22:07:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:04,631 INFO L225 Difference]: With dead ends: 50 [2020-08-22 22:07:04,631 INFO L226 Difference]: Without dead ends: 44 [2020-08-22 22:07:04,632 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 22:07:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-08-22 22:07:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-08-22 22:07:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 22:07:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-08-22 22:07:04,652 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-08-22 22:07:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:04,653 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-08-22 22:07:04,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 22:07:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-08-22 22:07:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-08-22 22:07:04,655 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:04,656 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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 22:07:04,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 22:07:04,656 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:04,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:04,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-08-22 22:07:04,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:04,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [987624609] [2020-08-22 22:07:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:07:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 22:07:04,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [987624609] [2020-08-22 22:07:04,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:04,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 22:07:04,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608908219] [2020-08-22 22:07:04,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:07:04,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:04,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:07:04,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:07:04,798 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-08-22 22:07:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:04,902 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-08-22 22:07:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 22:07:04,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-08-22 22:07:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:04,905 INFO L225 Difference]: With dead ends: 82 [2020-08-22 22:07:04,905 INFO L226 Difference]: Without dead ends: 46 [2020-08-22 22:07:04,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-08-22 22:07:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-08-22 22:07:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-08-22 22:07:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-08-22 22:07:04,931 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-08-22 22:07:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:04,931 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-08-22 22:07:04,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:07:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-08-22 22:07:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-08-22 22:07:04,937 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:04,937 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2020-08-22 22:07:04,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 22:07:04,940 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-08-22 22:07:04,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:04,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [722379937] [2020-08-22 22:07:04,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 22:07:05,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [722379937] [2020-08-22 22:07:05,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:05,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 22:07:05,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364599970] [2020-08-22 22:07:05,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:07:05,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:07:05,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:07:05,115 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-08-22 22:07:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:05,326 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-08-22 22:07:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 22:07:05,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-08-22 22:07:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:05,329 INFO L225 Difference]: With dead ends: 74 [2020-08-22 22:07:05,329 INFO L226 Difference]: Without dead ends: 68 [2020-08-22 22:07:05,330 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-22 22:07:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-08-22 22:07:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-08-22 22:07:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-22 22:07:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-08-22 22:07:05,349 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-08-22 22:07:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:05,349 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-08-22 22:07:05,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:07:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-08-22 22:07:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 22:07:05,352 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:05,352 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:05,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 22:07:05,353 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:05,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-08-22 22:07:05,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:05,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [563923234] [2020-08-22 22:07:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:07:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 22:07:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 22:07:05,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [563923234] [2020-08-22 22:07:05,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:05,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 22:07:05,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588428543] [2020-08-22 22:07:05,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 22:07:05,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:05,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 22:07:05,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 22:07:05,504 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-08-22 22:07:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:05,637 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-08-22 22:07:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 22:07:05,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-08-22 22:07:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:05,643 INFO L225 Difference]: With dead ends: 130 [2020-08-22 22:07:05,643 INFO L226 Difference]: Without dead ends: 70 [2020-08-22 22:07:05,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:07:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-22 22:07:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-08-22 22:07:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 22:07:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-08-22 22:07:05,675 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-08-22 22:07:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:05,678 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-08-22 22:07:05,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 22:07:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-08-22 22:07:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 22:07:05,686 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:05,686 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:05,686 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 22:07:05,687 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-08-22 22:07:05,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:05,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1792417752] [2020-08-22 22:07:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 22:07:05,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1792417752] [2020-08-22 22:07:05,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:05,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:07:05,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582081470] [2020-08-22 22:07:05,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:07:05,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:05,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:07:05,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:05,814 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-08-22 22:07:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:05,921 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-08-22 22:07:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 22:07:05,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-22 22:07:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:05,924 INFO L225 Difference]: With dead ends: 142 [2020-08-22 22:07:05,924 INFO L226 Difference]: Without dead ends: 78 [2020-08-22 22:07:05,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:07:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-08-22 22:07:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-08-22 22:07:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-22 22:07:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-08-22 22:07:05,942 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-08-22 22:07:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:05,943 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-08-22 22:07:05,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:07:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-08-22 22:07:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 22:07:05,945 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:05,945 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:05,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 22:07:05,946 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:05,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-08-22 22:07:05,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:05,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2080413513] [2020-08-22 22:07:05,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:05,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 22:07:06,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2080413513] [2020-08-22 22:07:06,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:06,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:07:06,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037347812] [2020-08-22 22:07:06,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:07:06,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:06,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:07:06,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:06,155 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-08-22 22:07:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:06,358 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-08-22 22:07:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 22:07:06,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-22 22:07:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:06,362 INFO L225 Difference]: With dead ends: 118 [2020-08-22 22:07:06,363 INFO L226 Difference]: Without dead ends: 112 [2020-08-22 22:07:06,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-08-22 22:07:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-08-22 22:07:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-08-22 22:07:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-08-22 22:07:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-08-22 22:07:06,400 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-08-22 22:07:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:06,400 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-08-22 22:07:06,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:07:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-08-22 22:07:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-22 22:07:06,402 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:06,402 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:06,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 22:07:06,403 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:06,404 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-08-22 22:07:06,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:06,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028373009] [2020-08-22 22:07:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-08-22 22:07:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-22 22:07:06,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028373009] [2020-08-22 22:07:06,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:06,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:07:06,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232233052] [2020-08-22 22:07:06,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:07:06,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:06,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:07:06,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:07:06,549 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-08-22 22:07:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:06,673 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-08-22 22:07:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 22:07:06,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-08-22 22:07:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:06,676 INFO L225 Difference]: With dead ends: 227 [2020-08-22 22:07:06,677 INFO L226 Difference]: Without dead ends: 127 [2020-08-22 22:07:06,678 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:07:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-08-22 22:07:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-08-22 22:07:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-08-22 22:07:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-08-22 22:07:06,702 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-08-22 22:07:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:06,703 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-08-22 22:07:06,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:07:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-08-22 22:07:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-08-22 22:07:06,705 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:06,705 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:06,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 22:07:06,706 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-08-22 22:07:06,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:06,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541691981] [2020-08-22 22:07:06,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-08-22 22:07:06,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541691981] [2020-08-22 22:07:06,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:06,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 22:07:06,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704000814] [2020-08-22 22:07:06,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 22:07:06,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 22:07:06,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:07:06,868 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-08-22 22:07:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:07,111 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-08-22 22:07:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 22:07:07,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-08-22 22:07:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:07,115 INFO L225 Difference]: With dead ends: 257 [2020-08-22 22:07:07,115 INFO L226 Difference]: Without dead ends: 151 [2020-08-22 22:07:07,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-08-22 22:07:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-08-22 22:07:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-08-22 22:07:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-22 22:07:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-08-22 22:07:07,142 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-08-22 22:07:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:07,143 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-08-22 22:07:07,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 22:07:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-08-22 22:07:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-22 22:07:07,146 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:07,147 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:07,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 22:07:07,147 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:07,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:07,148 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-08-22 22:07:07,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:07,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [399439898] [2020-08-22 22:07:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-08-22 22:07:07,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [399439898] [2020-08-22 22:07:07,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:07,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 22:07:07,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950374573] [2020-08-22 22:07:07,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 22:07:07,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:07,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 22:07:07,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-22 22:07:07,402 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-08-22 22:07:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:07,829 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-08-22 22:07:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 22:07:07,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-08-22 22:07:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:07,834 INFO L225 Difference]: With dead ends: 265 [2020-08-22 22:07:07,834 INFO L226 Difference]: Without dead ends: 116 [2020-08-22 22:07:07,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-08-22 22:07:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-08-22 22:07:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2020-08-22 22:07:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-08-22 22:07:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2020-08-22 22:07:07,855 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 105 [2020-08-22 22:07:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:07,856 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2020-08-22 22:07:07,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 22:07:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2020-08-22 22:07:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-08-22 22:07:07,858 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:07,858 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2020-08-22 22:07:07,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 22:07:07,859 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:07,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1951493560, now seen corresponding path program 1 times [2020-08-22 22:07:07,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:07,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [736145333] [2020-08-22 22:07:07,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:07,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-08-22 22:07:08,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [736145333] [2020-08-22 22:07:08,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:08,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-22 22:07:08,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194200701] [2020-08-22 22:07:08,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-22 22:07:08,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:08,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-22 22:07:08,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-08-22 22:07:08,238 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand 17 states. [2020-08-22 22:07:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:08,693 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2020-08-22 22:07:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 22:07:08,694 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2020-08-22 22:07:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:08,696 INFO L225 Difference]: With dead ends: 137 [2020-08-22 22:07:08,696 INFO L226 Difference]: Without dead ends: 131 [2020-08-22 22:07:08,697 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2020-08-22 22:07:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-08-22 22:07:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2020-08-22 22:07:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-08-22 22:07:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2020-08-22 22:07:08,714 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 87 [2020-08-22 22:07:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:08,715 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2020-08-22 22:07:08,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-22 22:07:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2020-08-22 22:07:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-08-22 22:07:08,717 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:08,717 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-08-22 22:07:08,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 22:07:08,717 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:08,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:08,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1530276981, now seen corresponding path program 2 times [2020-08-22 22:07:08,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:08,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1677723002] [2020-08-22 22:07:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 22:07:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-08-22 22:07:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-08-22 22:07:08,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1677723002] [2020-08-22 22:07:08,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:08,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 22:07:08,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710811342] [2020-08-22 22:07:08,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:07:08,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:07:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:07:08,826 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand 7 states. [2020-08-22 22:07:08,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:08,924 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2020-08-22 22:07:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 22:07:08,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2020-08-22 22:07:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:08,927 INFO L225 Difference]: With dead ends: 197 [2020-08-22 22:07:08,927 INFO L226 Difference]: Without dead ends: 94 [2020-08-22 22:07:08,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:07:08,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-22 22:07:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-08-22 22:07:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-22 22:07:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2020-08-22 22:07:08,944 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 88 [2020-08-22 22:07:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:08,944 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2020-08-22 22:07:08,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:07:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2020-08-22 22:07:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-22 22:07:08,946 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:07:08,946 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:07:08,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 22:07:08,946 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:07:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:07:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 2 times [2020-08-22 22:07:08,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:07:08,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919897988] [2020-08-22 22:07:08,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:07:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:07:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:08,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:07:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:07:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 22:07:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:07:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:07:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:07:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:07:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 43 proven. 77 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-08-22 22:07:09,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1919897988] [2020-08-22 22:07:09,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:07:09,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 22:07:09,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825175817] [2020-08-22 22:07:09,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 22:07:09,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:07:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 22:07:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-08-22 22:07:09,170 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 11 states. [2020-08-22 22:07:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:07:09,444 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2020-08-22 22:07:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 22:07:09,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-08-22 22:07:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:07:09,446 INFO L225 Difference]: With dead ends: 176 [2020-08-22 22:07:09,446 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 22:07:09,448 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-08-22 22:07:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 22:07:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 22:07:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 22:07:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 22:07:09,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2020-08-22 22:07:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:07:09,450 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 22:07:09,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 22:07:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 22:07:09,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 22:07:09,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 22:07:09,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 22:07:12,055 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-08-22 22:07:12,664 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 33 [2020-08-22 22:07:12,903 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2020-08-22 22:07:13,240 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-08-22 22:07:13,427 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-08-22 22:07:13,635 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-08-22 22:07:13,834 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2020-08-22 22:07:14,020 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2020-08-22 22:07:14,222 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2020-08-22 22:07:14,746 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 33 [2020-08-22 22:07:14,852 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2020-08-22 22:07:15,142 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2020-08-22 22:07:15,311 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 19 [2020-08-22 22:07:15,329 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:07:15,330 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:07:15,330 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:07:15,330 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 22:07:15,330 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 22:07:15,330 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:07:15,330 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-08-22 22:07:15,330 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-08-22 22:07:15,330 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 4 main_~x~0) [2020-08-22 22:07:15,331 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 4 main_~x~0) [2020-08-22 22:07:15,331 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-08-22 22:07:15,331 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~result~0 3) (<= main_~x~0 4) (< 2 main_~result~0)) [2020-08-22 22:07:15,331 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~x~0 4)) [2020-08-22 22:07:15,331 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= 3 |main_#t~ret4|) (<= main_~x~0 4) (<= |main_#t~ret4| 3)) [2020-08-22 22:07:15,332 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 4 main_~x~0) [2020-08-22 22:07:15,332 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= 3 |main_#t~ret4|) (<= main_~x~0 4) (<= |main_#t~ret4| 3)) [2020-08-22 22:07:15,332 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= 3 |main_#t~ret4|) (<= main_~result~0 3) (<= main_~x~0 4) (< 2 main_~result~0) (<= |main_#t~ret4| 3)) [2020-08-22 22:07:15,332 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-08-22 22:07:15,332 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:15,333 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) .cse0))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:15,333 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1) (< 0 fibo2_~n)) [2020-08-22 22:07:15,333 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) .cse0))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:15,333 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-08-22 22:07:15,333 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (and (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|))) (or (and (<= .cse0 2) (<= 3 fibo2_~n) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and (<= 4 fibo2_~n) .cse2) (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= |fibo2_#in~n| 2)))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:15,333 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-08-22 22:07:15,334 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (and (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|))) (or (and (<= .cse0 2) (<= 3 fibo2_~n) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and (<= 4 fibo2_~n) .cse2) (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= |fibo2_#in~n| 2)))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:15,334 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-08-22 22:07:15,334 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (and (let ((.cse2 (<= |fibo2_#t~ret2| 1)) (.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|)) (.cse1 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (or (and (<= 4 fibo2_~n) .cse0) (and (<= 1 .cse1) (<= .cse1 1) (<= 1 |fibo2_#res|) .cse2 (<= |fibo2_#res| 1) .cse0 .cse3 (<= |fibo2_#in~n| 2)) (and (<= .cse1 2) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse2 .cse0 .cse3 (<= 2 .cse1)))) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:15,334 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (and (let ((.cse0 (<= |fibo2_#t~ret2| 1)) (.cse1 (<= 1 |fibo2_#t~ret2|))) (or (and (<= 1 |fibo2_#res|) .cse0 (<= |fibo2_#res| 1) .cse1 (<= |fibo2_#in~n| 2)) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse0 .cse1) (not (<= |fibo2_#in~n| 3)))) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-08-22 22:07:15,334 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (let ((.cse3 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= 1 |fibo2_#res|)) (.cse5 (<= |fibo2_#res| 1)) (.cse2 (<= |fibo2_#in~n| 1))) (let ((.cse1 (and .cse4 .cse5 .cse2 (< 0 fibo2_~n))) (.cse0 (and .cse4 .cse5 .cse3 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) (and (or .cse0 (<= 4 fibo2_~n) .cse1 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) (<= |fibo2_#in~n| 0)) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (not .cse2)) (or .cse0 (and (<= 3 fibo2_~n) .cse3) (and .cse3 .cse2))))) [2020-08-22 22:07:15,335 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (let ((.cse3 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= 1 |fibo2_#res|)) (.cse5 (<= |fibo2_#res| 1)) (.cse2 (<= |fibo2_#in~n| 1))) (let ((.cse1 (and .cse4 .cse5 .cse2 (< 0 fibo2_~n))) (.cse0 (and .cse4 .cse5 .cse3 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) (and (or .cse0 (<= 4 fibo2_~n) .cse1 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) (<= |fibo2_#in~n| 0)) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (not .cse2)) (or .cse0 (and (<= 3 fibo2_~n) .cse3) (and .cse3 .cse2))))) [2020-08-22 22:07:15,335 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-08-22 22:07:15,335 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-08-22 22:07:15,335 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-08-22 22:07:15,335 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-08-22 22:07:15,335 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-08-22 22:07:15,335 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (<= |fibo1_#in~n| 2)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= |fibo1_#in~n| 1) .cse1 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|)) (<= |fibo1_#in~n| 3)) .cse1 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0 .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-08-22 22:07:15,335 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-08-22 22:07:15,336 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (or (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= .cse1 3) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) (<= 3 .cse1))) (and (<= |fibo1_#t~ret0| 1) (<= |fibo1_#in~n| 3) (<= 1 |fibo1_#t~ret0|)))) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-08-22 22:07:15,336 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-08-22 22:07:15,336 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (or (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= .cse1 3) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) (<= 3 .cse1))) (and (<= |fibo1_#t~ret0| 1) (<= |fibo1_#in~n| 3) (<= 1 |fibo1_#t~ret0|)))) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-08-22 22:07:15,336 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-08-22 22:07:15,336 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse3 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse1 (<= 2 |fibo1_#t~ret0|)) (.cse2 (and (<= 5 |fibo1_#in~n|) .cse3))) (and (or (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|)) (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= |fibo1_#res| 3) (<= .cse0 3) (<= 3 |fibo1_#res|) .cse1 (<= |fibo1_#t~ret0| 2) (<= 3 .cse0))) .cse2) (not (<= |fibo1_#in~n| 2)) (or (and (<= |fibo1_#in~n| 3) .cse3) (and .cse1 .cse3) .cse2)))) [2020-08-22 22:07:15,336 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) (<= 4 fibo1_~n) .cse0) (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) [2020-08-22 22:07:15,337 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (<= |fibo1_#in~n| 2)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= |fibo1_#in~n| 1) .cse1 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|)) (<= |fibo1_#in~n| 3)) .cse1 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0 .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-08-22 22:07:15,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 10:07:15 BoogieIcfgContainer [2020-08-22 22:07:15,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 22:07:15,359 INFO L168 Benchmark]: Toolchain (without parser) took 12070.80 ms. Allocated memory was 137.9 MB in the beginning and 395.8 MB in the end (delta: 257.9 MB). Free memory was 102.1 MB in the beginning and 158.2 MB in the end (delta: -56.1 MB). Peak memory consumption was 240.7 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:15,360 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 120.5 MB in the beginning and 120.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-08-22 22:07:15,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.99 ms. Allocated memory is still 137.9 MB. Free memory was 101.7 MB in the beginning and 92.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:15,362 INFO L168 Benchmark]: Boogie Preprocessor took 108.61 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 180.1 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:15,362 INFO L168 Benchmark]: RCFGBuilder took 280.66 ms. Allocated memory is still 201.3 MB. Free memory was 180.1 MB in the beginning and 165.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:15,363 INFO L168 Benchmark]: TraceAbstraction took 11439.39 ms. Allocated memory was 201.3 MB in the beginning and 395.8 MB in the end (delta: 194.5 MB). Free memory was 165.1 MB in the beginning and 158.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 240.2 MB. Max. memory is 7.1 GB. [2020-08-22 22:07:15,366 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 120.5 MB in the beginning and 120.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 233.99 ms. Allocated memory is still 137.9 MB. Free memory was 101.7 MB in the beginning and 92.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.61 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 180.1 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 280.66 ms. Allocated memory is still 201.3 MB. Free memory was 180.1 MB in the beginning and 165.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11439.39 ms. Allocated memory was 201.3 MB in the beginning and 395.8 MB in the end (delta: 194.5 MB). Free memory was 165.1 MB in the beginning and 158.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 240.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 4 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((((((((1 <= \result && \result <= 1) && n == \old(n)) && 2 <= \old(n)) && \old(n) <= 2) || 4 <= n) || (((1 <= \result && \result <= 1) && \old(n) <= 1) && 0 < n)) || (\result <= 2 && 2 <= \result)) || \old(n) <= 0) && (((((1 <= \result && \result <= 1) && \old(n) <= 1) && 0 < n) || (\result <= 0 && 0 <= \result)) || !(\old(n) <= 1))) && ((((((1 <= \result && \result <= 1) && n == \old(n)) && 2 <= \old(n)) && \old(n) <= 2) || (3 <= n && n == \old(n))) || (n == \old(n) && \old(n) <= 1)) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((((\old(n) <= 2 && \old(n) <= 1) && n == \old(n)) && \result <= 1) && 1 <= \result) || ((((\result <= 3 && 3 <= \result) || \old(n) <= 3) && n == \old(n)) && 3 <= \old(n))) || ((\old(n) <= 0 && \old(n) <= 2) && n == \old(n))) || (5 <= \old(n) && n == \old(n))) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.4s, OverallIterations: 13, TraceHistogramMax: 7, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 584 SDtfs, 508 SDslu, 2856 SDs, 0 SdLazy, 1556 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=9, 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, 13 MinimizatonAttempts, 81 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 1599 PreInvPairs, 2791 NumberOfFragments, 1033 HoareAnnotationTreeSize, 1599 FomulaSimplifications, 46456 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 15203 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 795 NumberOfCodeBlocks, 795 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 125112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 465/701 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 correct! Received shutdown request...