/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/id_i10_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:21:23,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:21:23,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:21:23,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:21:23,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:21:23,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:21:23,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:21:24,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:21:24,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:21:24,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:21:24,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:21:24,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:21:24,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:21:24,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:21:24,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:21:24,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:21:24,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:21:24,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:21:24,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:21:24,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:21:24,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:21:24,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:21:24,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:21:24,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:21:24,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:21:24,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:21:24,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:21:24,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:21:24,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:21:24,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:21:24,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:21:24,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:21:24,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:21:24,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:21:24,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:21:24,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:21:24,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:21:24,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:21:24,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:21:24,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:21:24,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:21:24,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:21:24,075 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:21:24,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:21:24,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:21:24,077 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:21:24,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:21:24,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:21:24,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:21:24,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:21:24,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:21:24,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:21:24,078 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:21:24,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:21:24,078 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:21:24,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:21:24,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:21:24,079 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:21:24,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:21:24,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:21:24,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:21:24,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:21:24,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:21:24,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:21:24,080 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-07-17 17:21:24,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:21:24,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:21:24,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:21:24,373 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:21:24,373 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:21:24,374 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-07-17 17:21:24,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9159a03/716b7bf146204ac883ccf0fe711b96fa/FLAGab8d9298e [2020-07-17 17:21:24,877 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:21:24,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-07-17 17:21:24,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9159a03/716b7bf146204ac883ccf0fe711b96fa/FLAGab8d9298e [2020-07-17 17:21:25,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9159a03/716b7bf146204ac883ccf0fe711b96fa [2020-07-17 17:21:25,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:21:25,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:21:25,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:21:25,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:21:25,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:21:25,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:21:25" (1/1) ... [2020-07-17 17:21:25,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e6abe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25, skipping insertion in model container [2020-07-17 17:21:25,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:21:25" (1/1) ... [2020-07-17 17:21:25,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:21:25,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:21:25,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:21:25,493 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:21:25,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:21:25,530 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:21:25,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25 WrapperNode [2020-07-17 17:21:25,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:21:25,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:21:25,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:21:25,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:21:25,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25" (1/1) ... [2020-07-17 17:21:25,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25" (1/1) ... [2020-07-17 17:21:25,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25" (1/1) ... [2020-07-17 17:21:25,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25" (1/1) ... [2020-07-17 17:21:25,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25" (1/1) ... [2020-07-17 17:21:25,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25" (1/1) ... [2020-07-17 17:21:25,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25" (1/1) ... [2020-07-17 17:21:25,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:21:25,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:21:25,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:21:25,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:21:25,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:21:25,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:21:25,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:21:25,781 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-17 17:21:25,781 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:21:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 17:21:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:21:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-17 17:21:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:21:25,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:21:25,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:21:25,947 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:21:25,948 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:21:25,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:21:25 BoogieIcfgContainer [2020-07-17 17:21:25,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:21:25,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:21:25,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:21:25,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:21:25,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:21:25" (1/3) ... [2020-07-17 17:21:25,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2c7686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:21:25, skipping insertion in model container [2020-07-17 17:21:25,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:21:25" (2/3) ... [2020-07-17 17:21:25,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2c7686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:21:25, skipping insertion in model container [2020-07-17 17:21:25,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:21:25" (3/3) ... [2020-07-17 17:21:25,962 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2020-07-17 17:21:25,973 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:21:25,980 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:21:25,995 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:21:26,020 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:21:26,020 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:21:26,020 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:21:26,020 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:21:26,020 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:21:26,021 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:21:26,021 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:21:26,021 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:21:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-17 17:21:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 17:21:26,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:26,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:26,049 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:26,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:26,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-07-17 17:21:26,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:26,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1931211069] [2020-07-17 17:21:26,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:21:26,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1931211069] [2020-07-17 17:21:26,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:21:26,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:21:26,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908505926] [2020-07-17 17:21:26,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:21:26,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:26,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:21:26,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:21:26,382 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-07-17 17:21:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:26,493 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 17:21:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:21:26,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 17:21:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:26,509 INFO L225 Difference]: With dead ends: 37 [2020-07-17 17:21:26,509 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 17:21:26,514 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-07-17 17:21:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 17:21:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-17 17:21:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 17:21:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-17 17:21:26,583 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-07-17 17:21:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:26,584 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-17 17:21:26,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:21:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-17 17:21:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 17:21:26,588 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:26,588 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] [2020-07-17 17:21:26,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:21:26,589 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-07-17 17:21:26,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:26,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1192051636] [2020-07-17 17:21:26,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 17:21:26,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1192051636] [2020-07-17 17:21:26,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:26,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:21:26,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578298326] [2020-07-17 17:21:26,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:21:26,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:26,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:21:26,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:21:26,734 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-07-17 17:21:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:26,804 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-17 17:21:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 17:21:26,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-17 17:21:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:26,807 INFO L225 Difference]: With dead ends: 34 [2020-07-17 17:21:26,808 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 17:21:26,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:21:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 17:21:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-17 17:21:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 17:21:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-17 17:21:26,822 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-07-17 17:21:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:26,823 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-17 17:21:26,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:21:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 17:21:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 17:21:26,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:26,826 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:26,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:21:26,827 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:26,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-07-17 17:21:26,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:26,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510832796] [2020-07-17 17:21:26,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 17:21:26,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510832796] [2020-07-17 17:21:26,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:26,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:21:26,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340015819] [2020-07-17 17:21:26,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:21:26,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:26,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:21:26,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:21:26,991 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-17 17:21:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:27,068 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-17 17:21:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:21:27,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-17 17:21:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:27,071 INFO L225 Difference]: With dead ends: 39 [2020-07-17 17:21:27,071 INFO L226 Difference]: Without dead ends: 33 [2020-07-17 17:21:27,072 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:21:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-17 17:21:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-17 17:21:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 17:21:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-17 17:21:27,084 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-07-17 17:21:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:27,085 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-17 17:21:27,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:21:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-17 17:21:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 17:21:27,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:27,087 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:27,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:21:27,088 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:27,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-07-17 17:21:27,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:27,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356645801] [2020-07-17 17:21:27,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-17 17:21:27,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356645801] [2020-07-17 17:21:27,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:27,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:21:27,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463923389] [2020-07-17 17:21:27,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:21:27,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:21:27,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:21:27,257 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-07-17 17:21:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:27,365 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-17 17:21:27,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:21:27,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-17 17:21:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:27,367 INFO L225 Difference]: With dead ends: 44 [2020-07-17 17:21:27,367 INFO L226 Difference]: Without dead ends: 38 [2020-07-17 17:21:27,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:21:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-17 17:21:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-17 17:21:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 17:21:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-17 17:21:27,380 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-07-17 17:21:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:27,380 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-17 17:21:27,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:21:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-17 17:21:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-17 17:21:27,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:27,382 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:27,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:21:27,383 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:27,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-07-17 17:21:27,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:27,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [900652312] [2020-07-17 17:21:27,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-17 17:21:27,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [900652312] [2020-07-17 17:21:27,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:27,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 17:21:27,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136067028] [2020-07-17 17:21:27,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 17:21:27,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:27,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 17:21:27,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-17 17:21:27,560 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-07-17 17:21:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:27,649 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-17 17:21:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:21:27,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-17 17:21:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:27,652 INFO L225 Difference]: With dead ends: 49 [2020-07-17 17:21:27,652 INFO L226 Difference]: Without dead ends: 43 [2020-07-17 17:21:27,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:21:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-17 17:21:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-17 17:21:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 17:21:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-17 17:21:27,664 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-07-17 17:21:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:27,665 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-17 17:21:27,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 17:21:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-17 17:21:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-17 17:21:27,667 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:27,667 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:27,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:21:27,668 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:27,668 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-07-17 17:21:27,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:27,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1434831755] [2020-07-17 17:21:27,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-17 17:21:27,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1434831755] [2020-07-17 17:21:27,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:27,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:21:27,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568660941] [2020-07-17 17:21:27,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:21:27,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:21:27,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:21:27,876 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-07-17 17:21:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:27,987 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-17 17:21:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 17:21:27,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-07-17 17:21:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:27,990 INFO L225 Difference]: With dead ends: 54 [2020-07-17 17:21:27,990 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 17:21:27,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:21:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 17:21:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-17 17:21:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-17 17:21:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-07-17 17:21:28,003 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-07-17 17:21:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:28,004 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-07-17 17:21:28,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:21:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-17 17:21:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-17 17:21:28,006 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:28,007 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:28,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:21:28,007 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-07-17 17:21:28,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:28,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793140902] [2020-07-17 17:21:28,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-17 17:21:28,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793140902] [2020-07-17 17:21:28,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:28,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:21:28,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833938975] [2020-07-17 17:21:28,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:21:28,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:28,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:21:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:21:28,234 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-07-17 17:21:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:28,345 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-17 17:21:28,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 17:21:28,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-07-17 17:21:28,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:28,347 INFO L225 Difference]: With dead ends: 59 [2020-07-17 17:21:28,347 INFO L226 Difference]: Without dead ends: 53 [2020-07-17 17:21:28,348 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:21:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-17 17:21:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-17 17:21:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-17 17:21:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-07-17 17:21:28,358 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-07-17 17:21:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:28,359 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-07-17 17:21:28,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:21:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-07-17 17:21:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-17 17:21:28,360 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:28,360 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:28,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:21:28,361 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-07-17 17:21:28,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:28,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [126872040] [2020-07-17 17:21:28,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-07-17 17:21:28,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [126872040] [2020-07-17 17:21:28,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:28,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:21:28,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783453957] [2020-07-17 17:21:28,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:21:28,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:21:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:21:28,588 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-07-17 17:21:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:28,704 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-07-17 17:21:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:21:28,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-07-17 17:21:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:28,707 INFO L225 Difference]: With dead ends: 64 [2020-07-17 17:21:28,707 INFO L226 Difference]: Without dead ends: 58 [2020-07-17 17:21:28,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-07-17 17:21:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-17 17:21:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-07-17 17:21:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-17 17:21:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-07-17 17:21:28,717 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-07-17 17:21:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:28,718 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-07-17 17:21:28,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:21:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-17 17:21:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-17 17:21:28,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:28,720 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:28,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:21:28,720 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:28,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-07-17 17:21:28,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:28,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227846010] [2020-07-17 17:21:28,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-07-17 17:21:29,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227846010] [2020-07-17 17:21:29,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:29,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-17 17:21:29,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734906251] [2020-07-17 17:21:29,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 17:21:29,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:29,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 17:21:29,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-07-17 17:21:29,015 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-07-17 17:21:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:29,187 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-07-17 17:21:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 17:21:29,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-07-17 17:21:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:29,189 INFO L225 Difference]: With dead ends: 69 [2020-07-17 17:21:29,189 INFO L226 Difference]: Without dead ends: 63 [2020-07-17 17:21:29,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:21:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-17 17:21:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-07-17 17:21:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-17 17:21:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-07-17 17:21:29,210 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-07-17 17:21:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:29,212 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-07-17 17:21:29,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 17:21:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-07-17 17:21:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-07-17 17:21:29,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:29,214 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:29,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:21:29,215 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-07-17 17:21:29,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:29,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [550798955] [2020-07-17 17:21:29,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-07-17 17:21:29,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [550798955] [2020-07-17 17:21:29,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:29,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:21:29,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289709618] [2020-07-17 17:21:29,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:21:29,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:29,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:21:29,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:21:29,714 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-07-17 17:21:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:29,875 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-07-17 17:21:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:21:29,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-07-17 17:21:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:29,877 INFO L225 Difference]: With dead ends: 74 [2020-07-17 17:21:29,877 INFO L226 Difference]: Without dead ends: 68 [2020-07-17 17:21:29,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-07-17 17:21:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-17 17:21:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-17 17:21:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-17 17:21:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-07-17 17:21:29,888 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-07-17 17:21:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:29,889 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-07-17 17:21:29,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:21:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-07-17 17:21:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-17 17:21:29,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:29,890 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:29,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:21:29,891 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-07-17 17:21:29,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:29,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [964771391] [2020-07-17 17:21:29,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-07-17 17:21:30,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [964771391] [2020-07-17 17:21:30,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:30,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-07-17 17:21:30,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849133422] [2020-07-17 17:21:30,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-17 17:21:30,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:30,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-17 17:21:30,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-07-17 17:21:30,747 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 25 states. [2020-07-17 17:21:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:31,561 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-07-17 17:21:31,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-17 17:21:31,562 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 96 [2020-07-17 17:21:31,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:31,563 INFO L225 Difference]: With dead ends: 79 [2020-07-17 17:21:31,563 INFO L226 Difference]: Without dead ends: 73 [2020-07-17 17:21:31,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2020-07-17 17:21:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-17 17:21:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-07-17 17:21:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-17 17:21:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-07-17 17:21:31,577 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-07-17 17:21:31,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:31,578 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-07-17 17:21:31,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-17 17:21:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-07-17 17:21:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-17 17:21:31,579 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:21:31,579 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:21:31,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:21:31,580 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:21:31,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:21:31,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-07-17 17:21:31,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:21:31,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666706733] [2020-07-17 17:21:31,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:21:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:21:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 275 proven. 22 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-07-17 17:21:31,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666706733] [2020-07-17 17:21:31,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:21:31,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:21:31,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339766127] [2020-07-17 17:21:31,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:21:31,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:21:31,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:21:31,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:21:31,995 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-07-17 17:21:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:21:32,519 INFO L93 Difference]: Finished difference Result 151 states and 272 transitions. [2020-07-17 17:21:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 17:21:32,520 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-07-17 17:21:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:21:32,520 INFO L225 Difference]: With dead ends: 151 [2020-07-17 17:21:32,521 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 17:21:32,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:21:32,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 17:21:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 17:21:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 17:21:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 17:21:32,526 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2020-07-17 17:21:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:21:32,526 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 17:21:32,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:21:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 17:21:32,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 17:21:32,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:21:32,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 17:21:33,352 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 90 [2020-07-17 17:21:33,760 WARN L193 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2020-07-17 17:21:34,246 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2020-07-17 17:21:34,734 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2020-07-17 17:21:35,118 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2020-07-17 17:21:35,126 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:21:35,126 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:21:35,126 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:21:35,126 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 17:21:35,127 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 17:21:35,127 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:21:35,127 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: false [2020-07-17 17:21:35,127 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-07-17 17:21:35,128 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 9 15) the Hoare annotation is: (<= 10 main_~input~0) [2020-07-17 17:21:35,128 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: false [2020-07-17 17:21:35,128 INFO L264 CegarLoopResult]: At program point L12(lines 12 14) the Hoare annotation is: (and (<= main_~result~0 10) (< 9 main_~result~0) (<= 10 main_~input~0)) [2020-07-17 17:21:35,128 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= 10 main_~input~0) (<= main_~input~0 10)) [2020-07-17 17:21:35,128 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (<= 10 main_~input~0) (<= 10 |main_#t~ret1|) (<= |main_#t~ret1| 10)) [2020-07-17 17:21:35,128 INFO L264 CegarLoopResult]: At program point L12-2(lines 9 15) the Hoare annotation is: (<= 10 main_~input~0) [2020-07-17 17:21:35,129 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (and (<= 10 main_~input~0) (<= 10 |main_#t~ret1|) (<= |main_#t~ret1| 10)) [2020-07-17 17:21:35,129 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (<= main_~result~0 10) (< 9 main_~result~0) (<= 10 main_~input~0) (<= 10 |main_#t~ret1|) (<= |main_#t~ret1| 10)) [2020-07-17 17:21:35,129 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 7) the Hoare annotation is: (let ((.cse7 (<= 6 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse1 (and (<= |id_#res| 9) (<= |id_#in~x| 9) (<= 9 |id_#in~x|) (<= 9 |id_#res|) .cse0)) (.cse2 (and (<= 11 |id_#in~x|) .cse0)) (.cse3 (and (<= 10 |id_#res|) (<= |id_#res| 10) (<= 10 |id_#in~x|) .cse0)) (.cse4 (and (<= |id_#res| 8) (<= |id_#in~x| 8) (<= 8 |id_#res|) (<= 8 |id_#in~x|) .cse0)) (.cse5 (and (<= |id_#res| 6) (<= 6 |id_#res|) (<= |id_#in~x| 6) .cse0 .cse7)) (.cse6 (and (<= |id_#in~x| 7) (<= |id_#res| 7) (<= 7 |id_#res|) (<= 7 |id_#in~x|) .cse0))) (and (or (and (<= |id_#res| 4) (<= 4 |id_#in~x|) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4)) .cse1 .cse2 .cse3 (and (<= |id_#res| 3) (<= |id_#in~x| 3) (<= 3 |id_#in~x|) (<= 3 |id_#res|) .cse0) (and (= 0 |id_#in~x|) .cse0 (= 0 |id_#res|)) .cse4 (and (<= 5 |id_#res|) (<= |id_#res| 5) (<= 5 |id_#in~x|) .cse0) .cse5 (and (<= 1 |id_#res|) (<= 1 |id_#in~x|) (<= |id_#res| 1) (<= |id_#in~x| 1) .cse0) .cse6 (and (<= |id_#res| 2) (<= 2 |id_#res|) (<= |id_#in~x| 2) .cse0 (<= 2 |id_#in~x|))) (or .cse1 .cse2 .cse3 (not .cse7) .cse4 .cse5 .cse6)))) [2020-07-17 17:21:35,130 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 7) the Hoare annotation is: (let ((.cse7 (<= 6 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse1 (and (<= |id_#res| 9) (<= |id_#in~x| 9) (<= 9 |id_#in~x|) (<= 9 |id_#res|) .cse0)) (.cse2 (and (<= 11 |id_#in~x|) .cse0)) (.cse3 (and (<= 10 |id_#res|) (<= |id_#res| 10) (<= 10 |id_#in~x|) .cse0)) (.cse4 (and (<= |id_#res| 8) (<= |id_#in~x| 8) (<= 8 |id_#res|) (<= 8 |id_#in~x|) .cse0)) (.cse5 (and (<= |id_#res| 6) (<= 6 |id_#res|) (<= |id_#in~x| 6) .cse0 .cse7)) (.cse6 (and (<= |id_#in~x| 7) (<= |id_#res| 7) (<= 7 |id_#res|) (<= 7 |id_#in~x|) .cse0))) (and (or (and (<= |id_#res| 4) (<= 4 |id_#in~x|) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4)) .cse1 .cse2 .cse3 (and (<= |id_#res| 3) (<= |id_#in~x| 3) (<= 3 |id_#in~x|) (<= 3 |id_#res|) .cse0) (and (= 0 |id_#in~x|) .cse0 (= 0 |id_#res|)) .cse4 (and (<= 5 |id_#res|) (<= |id_#res| 5) (<= 5 |id_#in~x|) .cse0) .cse5 (and (<= 1 |id_#res|) (<= 1 |id_#in~x|) (<= |id_#res| 1) (<= |id_#in~x| 1) .cse0) .cse6 (and (<= |id_#res| 2) (<= 2 |id_#res|) (<= |id_#in~x| 2) .cse0 (<= 2 |id_#in~x|))) (or .cse1 .cse2 .cse3 (not .cse7) .cse4 .cse5 .cse6)))) [2020-07-17 17:21:35,130 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-07-17 17:21:35,130 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-17 17:21:35,130 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-07-17 17:21:35,131 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (let ((.cse12 (<= 3 |id_#in~x|)) (.cse9 (= |id_#in~x| id_~x)) (.cse11 (<= 2 |id_#in~x|))) (let ((.cse8 (and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|) .cse9 .cse11)) (.cse0 (and (<= |id_#in~x| 8) (<= 8 |id_#in~x|) (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse9)) (.cse1 (and (<= 10 |id_#in~x|) (<= |id_#t~ret0| 9) .cse9 (<= 9 |id_#t~ret0|))) (.cse2 (and (<= 5 |id_#t~ret0|) (<= |id_#t~ret0| 5) (<= |id_#in~x| 6) .cse9 (<= 6 |id_#in~x|))) (.cse3 (and (<= |id_#t~ret0| 6) (<= |id_#in~x| 7) (<= 7 |id_#in~x|) .cse9 (<= 6 |id_#t~ret0|))) (.cse4 (and (<= 11 |id_#in~x|) .cse9)) (.cse5 (and (<= |id_#in~x| 3) .cse12 (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|) .cse9)) (.cse6 (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4) (<= |id_#in~x| 5) (<= 5 |id_#in~x|) .cse9)) (.cse7 (and (<= |id_#in~x| 9) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8) .cse9 (<= 8 |id_#t~ret0|))) (.cse10 (and (<= 4 |id_#in~x|) (<= |id_#t~ret0| 3) .cse9 (<= 3 |id_#t~ret0|) (<= |id_#in~x| 4)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (= 0 |id_#t~ret0|) (<= 1 |id_#in~x|) .cse9) .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not .cse11) .cse10) (or (not .cse12) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10)))) [2020-07-17 17:21:35,131 INFO L264 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: (and (= 0 |id_#in~x|) (= |id_#in~x| id_~x)) [2020-07-17 17:21:35,131 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (let ((.cse9 (= |id_#in~x| id_~x)) (.cse11 (<= 2 |id_#in~x|))) (let ((.cse0 (and (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|) (<= |id_#in~x| 2) .cse9 .cse11)) (.cse1 (and (<= |id_#in~x| 8) (<= 8 |id_#in~x|) (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse9)) (.cse2 (and (<= 10 |id_#in~x|) (<= |id_#t~ret0| 9) .cse9 (<= 9 |id_#t~ret0|))) (.cse3 (and (<= 5 |id_#t~ret0|) (<= |id_#t~ret0| 5) (<= |id_#in~x| 6) .cse9 (<= 6 |id_#in~x|))) (.cse4 (and (<= |id_#in~x| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|) .cse9)) (.cse5 (and (<= |id_#t~ret0| 6) (<= |id_#in~x| 7) (<= 7 |id_#in~x|) .cse9 (<= 6 |id_#t~ret0|))) (.cse6 (and (<= 11 |id_#in~x|) .cse9)) (.cse7 (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4) (<= |id_#in~x| 5) (<= 5 |id_#in~x|) .cse9)) (.cse8 (and (<= |id_#in~x| 9) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8) .cse9 (<= 8 |id_#t~ret0|))) (.cse10 (and (<= 4 |id_#in~x|) (<= |id_#t~ret0| 3) .cse9 (<= 3 |id_#t~ret0|) (<= |id_#in~x| 4)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (= 0 |id_#t~ret0|) (<= 1 |id_#in~x|) .cse9) .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not .cse11) .cse10)))) [2020-07-17 17:21:35,132 INFO L264 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: (let ((.cse8 (= |id_#in~x| id_~x)) (.cse11 (<= 2 |id_#in~x|))) (let ((.cse0 (and (<= |id_#res| 2) (<= |id_#t~ret0| 1) (<= 1 |id_#t~ret0|) (<= 2 |id_#res|) (<= |id_#in~x| 2) .cse8 .cse11)) (.cse1 (and (<= |id_#res| 9) (<= |id_#in~x| 9) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8) (<= 9 |id_#res|) .cse8 (<= 8 |id_#t~ret0|))) (.cse2 (and (<= 10 |id_#res|) (<= |id_#res| 10) (<= 10 |id_#in~x|) (<= |id_#t~ret0| 9) .cse8 (<= 9 |id_#t~ret0|))) (.cse3 (and (<= |id_#res| 3) (<= |id_#in~x| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) (<= 3 |id_#res|) (<= 2 |id_#t~ret0|) .cse8)) (.cse4 (and (<= |id_#res| 8) (<= |id_#in~x| 8) (<= 8 |id_#res|) (<= 8 |id_#in~x|) (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse8)) (.cse5 (and (<= |id_#t~ret0| 6) (<= |id_#in~x| 7) (<= |id_#res| 7) (<= 7 |id_#res|) (<= 7 |id_#in~x|) .cse8 (<= 6 |id_#t~ret0|))) (.cse6 (and (<= |id_#res| 4) (<= 4 |id_#in~x|) (<= 4 |id_#res|) (<= |id_#t~ret0| 3) .cse8 (<= 3 |id_#t~ret0|) (<= |id_#in~x| 4))) (.cse7 (and (<= 11 |id_#in~x|) .cse8)) (.cse9 (and (<= 5 |id_#t~ret0|) (<= |id_#res| 6) (<= |id_#t~ret0| 5) (<= 6 |id_#res|) (<= |id_#in~x| 6) .cse8 (<= 6 |id_#in~x|))) (.cse10 (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4) (<= 5 |id_#res|) (<= |id_#res| 5) (<= |id_#in~x| 5) (<= 5 |id_#in~x|) .cse8))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= 0 |id_#t~ret0|) (<= 1 |id_#res|) (<= 1 |id_#in~x|) (<= |id_#res| 1) .cse8) .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not .cse11) .cse9 .cse10)))) [2020-07-17 17:21:35,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:21:35 BoogieIcfgContainer [2020-07-17 17:21:35,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:21:35,163 INFO L168 Benchmark]: Toolchain (without parser) took 9895.87 ms. Allocated memory was 137.9 MB in the beginning and 328.2 MB in the end (delta: 190.3 MB). Free memory was 101.8 MB in the beginning and 153.4 MB in the end (delta: -51.6 MB). Peak memory consumption was 195.2 MB. Max. memory is 7.1 GB. [2020-07-17 17:21:35,164 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 17:21:35,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.71 ms. Allocated memory is still 137.9 MB. Free memory was 101.4 MB in the beginning and 92.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-07-17 17:21:35,166 INFO L168 Benchmark]: Boogie Preprocessor took 35.22 ms. Allocated memory is still 137.9 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-17 17:21:35,167 INFO L168 Benchmark]: RCFGBuilder took 384.45 ms. Allocated memory was 137.9 MB in the beginning and 206.0 MB in the end (delta: 68.2 MB). Free memory was 90.8 MB in the beginning and 174.3 MB in the end (delta: -83.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:21:35,168 INFO L168 Benchmark]: TraceAbstraction took 9207.78 ms. Allocated memory was 206.0 MB in the beginning and 328.2 MB in the end (delta: 122.2 MB). Free memory was 173.6 MB in the beginning and 153.4 MB in the end (delta: 20.2 MB). Peak memory consumption was 198.8 MB. Max. memory is 7.1 GB. [2020-07-17 17:21:35,172 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.71 ms. Allocated memory is still 137.9 MB. Free memory was 101.4 MB in the beginning and 92.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.22 ms. Allocated memory is still 137.9 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 384.45 ms. Allocated memory was 137.9 MB in the beginning and 206.0 MB in the end (delta: 68.2 MB). Free memory was 90.8 MB in the beginning and 174.3 MB in the end (delta: -83.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9207.78 ms. Allocated memory was 206.0 MB in the beginning and 328.2 MB in the end (delta: 122.2 MB). Free memory was 173.6 MB in the beginning and 153.4 MB in the end (delta: 20.2 MB). Peak memory consumption was 198.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: 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: 9]: Procedure Contract for main Derived contract for procedure main: 10 <= input - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: (((((((((((((((\result <= 4 && 4 <= \old(x)) && 4 <= \result) && \old(x) == x) && \old(x) <= 4) || ((((\result <= 9 && \old(x) <= 9) && 9 <= \old(x)) && 9 <= \result) && \old(x) == x)) || (11 <= \old(x) && \old(x) == x)) || (((10 <= \result && \result <= 10) && 10 <= \old(x)) && \old(x) == x)) || ((((\result <= 3 && \old(x) <= 3) && 3 <= \old(x)) && 3 <= \result) && \old(x) == x)) || ((0 == \old(x) && \old(x) == x) && 0 == \result)) || ((((\result <= 8 && \old(x) <= 8) && 8 <= \result) && 8 <= \old(x)) && \old(x) == x)) || (((5 <= \result && \result <= 5) && 5 <= \old(x)) && \old(x) == x)) || ((((\result <= 6 && 6 <= \result) && \old(x) <= 6) && \old(x) == x) && 6 <= \old(x))) || ((((1 <= \result && 1 <= \old(x)) && \result <= 1) && \old(x) <= 1) && \old(x) == x)) || ((((\old(x) <= 7 && \result <= 7) && 7 <= \result) && 7 <= \old(x)) && \old(x) == x)) || ((((\result <= 2 && 2 <= \result) && \old(x) <= 2) && \old(x) == x) && 2 <= \old(x))) && ((((((((((\result <= 9 && \old(x) <= 9) && 9 <= \old(x)) && 9 <= \result) && \old(x) == x) || (11 <= \old(x) && \old(x) == x)) || (((10 <= \result && \result <= 10) && 10 <= \old(x)) && \old(x) == x)) || !(6 <= \old(x))) || ((((\result <= 8 && \old(x) <= 8) && 8 <= \result) && 8 <= \old(x)) && \old(x) == x)) || ((((\result <= 6 && 6 <= \result) && \old(x) <= 6) && \old(x) == x) && 6 <= \old(x))) || ((((\old(x) <= 7 && \result <= 7) && 7 <= \result) && 7 <= \old(x)) && \old(x) == x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.5s, OverallIterations: 12, TraceHistogramMax: 12, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 284 SDtfs, 382 SDslu, 1707 SDs, 0 SdLazy, 1433 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 124 PreInvPairs, 658 NumberOfFragments, 1790 HoareAnnotationTreeSize, 124 FomulaSimplifications, 721 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 25 FomulaSimplificationsInter, 4968 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 708 ConstructedInterpolants, 0 QuantifiedInterpolants, 145098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 1067/2024 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...