/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/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 23:03:06,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 23:03:06,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 23:03:06,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 23:03:06,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 23:03:06,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 23:03:06,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 23:03:06,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 23:03:06,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 23:03:06,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 23:03:06,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 23:03:06,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 23:03:06,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 23:03:06,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 23:03:06,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 23:03:06,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 23:03:06,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 23:03:06,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 23:03:06,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 23:03:06,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 23:03:06,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 23:03:06,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 23:03:06,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 23:03:06,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 23:03:06,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 23:03:06,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 23:03:06,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 23:03:06,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 23:03:06,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 23:03:06,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 23:03:06,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 23:03:06,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 23:03:06,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 23:03:06,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 23:03:06,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 23:03:06,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 23:03:06,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 23:03:06,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 23:03:06,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 23:03:06,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 23:03:06,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 23:03:06,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 23:03:06,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 23:03:06,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 23:03:06,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 23:03:06,571 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 23:03:06,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 23:03:06,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 23:03:06,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 23:03:06,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 23:03:06,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 23:03:06,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 23:03:06,572 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 23:03:06,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 23:03:06,576 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 23:03:06,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 23:03:06,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 23:03:06,577 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 23:03:06,577 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 23:03:06,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 23:03:06,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 23:03:06,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 23:03:06,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 23:03:06,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 23:03:06,578 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 23:03:06,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 23:03:06,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 23:03:06,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 23:03:06,910 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 23:03:06,911 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 23:03:06,912 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-08-22 23:03:06,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de83185e7/76c089625c764f5491077ff90b70e84a/FLAGa5d008937 [2020-08-22 23:03:07,526 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 23:03:07,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-08-22 23:03:07,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de83185e7/76c089625c764f5491077ff90b70e84a/FLAGa5d008937 [2020-08-22 23:03:07,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de83185e7/76c089625c764f5491077ff90b70e84a [2020-08-22 23:03:07,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 23:03:07,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 23:03:07,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 23:03:07,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 23:03:07,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 23:03:07,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:03:07" (1/1) ... [2020-08-22 23:03:07,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc51459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:07, skipping insertion in model container [2020-08-22 23:03:07,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:03:07" (1/1) ... [2020-08-22 23:03:07,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 23:03:07,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 23:03:08,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:03:08,053 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 23:03:08,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:03:08,094 INFO L208 MainTranslator]: Completed translation [2020-08-22 23:03:08,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08 WrapperNode [2020-08-22 23:03:08,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 23:03:08,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 23:03:08,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 23:03:08,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 23:03:08,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08" (1/1) ... [2020-08-22 23:03:08,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08" (1/1) ... [2020-08-22 23:03:08,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08" (1/1) ... [2020-08-22 23:03:08,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08" (1/1) ... [2020-08-22 23:03:08,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08" (1/1) ... [2020-08-22 23:03:08,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08" (1/1) ... [2020-08-22 23:03:08,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08" (1/1) ... [2020-08-22 23:03:08,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 23:03:08,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 23:03:08,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 23:03:08,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 23:03:08,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 23:03:08,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 23:03:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 23:03:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-08-22 23:03:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-08-22 23:03:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 23:03:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 23:03:08,308 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-08-22 23:03:08,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-08-22 23:03:08,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-08-22 23:03:08,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 23:03:08,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 23:03:08,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 23:03:08,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 23:03:08,714 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 23:03:08,714 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-08-22 23:03:08,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:03:08 BoogieIcfgContainer [2020-08-22 23:03:08,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 23:03:08,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 23:03:08,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 23:03:08,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 23:03:08,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 11:03:07" (1/3) ... [2020-08-22 23:03:08,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fae014b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:03:08, skipping insertion in model container [2020-08-22 23:03:08,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:03:08" (2/3) ... [2020-08-22 23:03:08,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fae014b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:03:08, skipping insertion in model container [2020-08-22 23:03:08,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:03:08" (3/3) ... [2020-08-22 23:03:08,727 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2020-08-22 23:03:08,739 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 23:03:08,747 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 23:03:08,763 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 23:03:08,788 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 23:03:08,789 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 23:03:08,789 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 23:03:08,789 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 23:03:08,789 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 23:03:08,790 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 23:03:08,790 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 23:03:08,790 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 23:03:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-08-22 23:03:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-22 23:03:08,821 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:08,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:08,822 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:08,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:08,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1441743938, now seen corresponding path program 1 times [2020-08-22 23:03:08,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:08,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [191587550] [2020-08-22 23:03:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:09,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 23:03:09,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [191587550] [2020-08-22 23:03:09,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:09,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 23:03:09,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58849095] [2020-08-22 23:03:09,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 23:03:09,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:09,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 23:03:09,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 23:03:09,075 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2020-08-22 23:03:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:09,291 INFO L93 Difference]: Finished difference Result 143 states and 210 transitions. [2020-08-22 23:03:09,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 23:03:09,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-08-22 23:03:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:09,306 INFO L225 Difference]: With dead ends: 143 [2020-08-22 23:03:09,307 INFO L226 Difference]: Without dead ends: 81 [2020-08-22 23:03:09,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 23:03:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-08-22 23:03:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2020-08-22 23:03:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-08-22 23:03:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2020-08-22 23:03:09,380 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 25 [2020-08-22 23:03:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:09,380 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2020-08-22 23:03:09,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 23:03:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2020-08-22 23:03:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-22 23:03:09,385 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:09,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:09,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 23:03:09,389 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1406858677, now seen corresponding path program 1 times [2020-08-22 23:03:09,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:09,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [995463928] [2020-08-22 23:03:09,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:09,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 23:03:09,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [995463928] [2020-08-22 23:03:09,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:09,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 23:03:09,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627430314] [2020-08-22 23:03:09,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 23:03:09,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:09,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 23:03:09,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 23:03:09,507 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand 5 states. [2020-08-22 23:03:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:09,643 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2020-08-22 23:03:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 23:03:09,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-08-22 23:03:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:09,648 INFO L225 Difference]: With dead ends: 85 [2020-08-22 23:03:09,648 INFO L226 Difference]: Without dead ends: 83 [2020-08-22 23:03:09,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 23:03:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-08-22 23:03:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2020-08-22 23:03:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-08-22 23:03:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2020-08-22 23:03:09,672 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 25 [2020-08-22 23:03:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:09,672 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2020-08-22 23:03:09,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 23:03:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2020-08-22 23:03:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-08-22 23:03:09,674 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:09,675 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:09,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 23:03:09,675 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:09,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1771333938, now seen corresponding path program 1 times [2020-08-22 23:03:09,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:09,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807966162] [2020-08-22 23:03:09,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:09,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:09,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 23:03:09,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807966162] [2020-08-22 23:03:09,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:09,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 23:03:09,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317019693] [2020-08-22 23:03:09,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 23:03:09,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 23:03:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 23:03:09,811 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 5 states. [2020-08-22 23:03:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:09,979 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2020-08-22 23:03:09,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 23:03:09,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-08-22 23:03:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:09,982 INFO L225 Difference]: With dead ends: 116 [2020-08-22 23:03:09,983 INFO L226 Difference]: Without dead ends: 114 [2020-08-22 23:03:09,983 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 23:03:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-08-22 23:03:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2020-08-22 23:03:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-08-22 23:03:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2020-08-22 23:03:10,005 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 30 [2020-08-22 23:03:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:10,005 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2020-08-22 23:03:10,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 23:03:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2020-08-22 23:03:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-08-22 23:03:10,007 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:10,007 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:10,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 23:03:10,008 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:10,008 INFO L82 PathProgramCache]: Analyzing trace with hash 456630219, now seen corresponding path program 1 times [2020-08-22 23:03:10,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:10,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [457053987] [2020-08-22 23:03:10,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 23:03:10,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [457053987] [2020-08-22 23:03:10,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:10,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 23:03:10,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611923829] [2020-08-22 23:03:10,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 23:03:10,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 23:03:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-08-22 23:03:10,105 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand 6 states. [2020-08-22 23:03:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:10,277 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2020-08-22 23:03:10,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 23:03:10,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-08-22 23:03:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:10,280 INFO L225 Difference]: With dead ends: 106 [2020-08-22 23:03:10,280 INFO L226 Difference]: Without dead ends: 104 [2020-08-22 23:03:10,281 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-22 23:03:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-08-22 23:03:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-08-22 23:03:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-22 23:03:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2020-08-22 23:03:10,302 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 35 [2020-08-22 23:03:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:10,303 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2020-08-22 23:03:10,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 23:03:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2020-08-22 23:03:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 23:03:10,305 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:10,305 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:10,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 23:03:10,306 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash 364478305, now seen corresponding path program 1 times [2020-08-22 23:03:10,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:10,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1566851942] [2020-08-22 23:03:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-08-22 23:03:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 23:03:10,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1566851942] [2020-08-22 23:03:10,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:10,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 23:03:10,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323135552] [2020-08-22 23:03:10,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 23:03:10,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 23:03:10,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 23:03:10,391 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand 5 states. [2020-08-22 23:03:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:10,498 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2020-08-22 23:03:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 23:03:10,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-08-22 23:03:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:10,501 INFO L225 Difference]: With dead ends: 135 [2020-08-22 23:03:10,501 INFO L226 Difference]: Without dead ends: 133 [2020-08-22 23:03:10,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 23:03:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-08-22 23:03:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2020-08-22 23:03:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-08-22 23:03:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2020-08-22 23:03:10,526 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 40 [2020-08-22 23:03:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:10,527 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2020-08-22 23:03:10,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 23:03:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2020-08-22 23:03:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-08-22 23:03:10,530 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:10,530 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:10,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 23:03:10,531 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:10,531 INFO L82 PathProgramCache]: Analyzing trace with hash 914533499, now seen corresponding path program 1 times [2020-08-22 23:03:10,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:10,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [757232912] [2020-08-22 23:03:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-08-22 23:03:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 23:03:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-22 23:03:10,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [757232912] [2020-08-22 23:03:10,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:10,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 23:03:10,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708069475] [2020-08-22 23:03:10,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 23:03:10,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 23:03:10,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-22 23:03:10,639 INFO L87 Difference]: Start difference. First operand 125 states and 162 transitions. Second operand 5 states. [2020-08-22 23:03:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:10,735 INFO L93 Difference]: Finished difference Result 229 states and 302 transitions. [2020-08-22 23:03:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 23:03:10,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2020-08-22 23:03:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:10,739 INFO L225 Difference]: With dead ends: 229 [2020-08-22 23:03:10,740 INFO L226 Difference]: Without dead ends: 128 [2020-08-22 23:03:10,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:03:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-08-22 23:03:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-08-22 23:03:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-08-22 23:03:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2020-08-22 23:03:10,767 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 58 [2020-08-22 23:03:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:10,768 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2020-08-22 23:03:10,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 23:03:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-08-22 23:03:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-08-22 23:03:10,771 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:10,771 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:10,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 23:03:10,771 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:10,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1807369608, now seen corresponding path program 1 times [2020-08-22 23:03:10,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:10,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1935402527] [2020-08-22 23:03:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-08-22 23:03:10,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1935402527] [2020-08-22 23:03:10,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:10,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:03:10,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948735002] [2020-08-22 23:03:10,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:03:10,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:10,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:03:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:03:10,959 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand 7 states. [2020-08-22 23:03:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:11,189 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2020-08-22 23:03:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 23:03:11,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2020-08-22 23:03:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:11,192 INFO L225 Difference]: With dead ends: 136 [2020-08-22 23:03:11,193 INFO L226 Difference]: Without dead ends: 134 [2020-08-22 23:03:11,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:03:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-08-22 23:03:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2020-08-22 23:03:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-08-22 23:03:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2020-08-22 23:03:11,216 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 64 [2020-08-22 23:03:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:11,217 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2020-08-22 23:03:11,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:03:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2020-08-22 23:03:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-22 23:03:11,219 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:11,219 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:11,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 23:03:11,220 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1715909932, now seen corresponding path program 1 times [2020-08-22 23:03:11,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:11,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229572719] [2020-08-22 23:03:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 23:03:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-08-22 23:03:11,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229572719] [2020-08-22 23:03:11,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:11,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:03:11,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654968438] [2020-08-22 23:03:11,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:03:11,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:11,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:03:11,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:03:11,367 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand 7 states. [2020-08-22 23:03:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:11,537 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2020-08-22 23:03:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 23:03:11,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2020-08-22 23:03:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:11,541 INFO L225 Difference]: With dead ends: 162 [2020-08-22 23:03:11,541 INFO L226 Difference]: Without dead ends: 160 [2020-08-22 23:03:11,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:03:11,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-08-22 23:03:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2020-08-22 23:03:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-08-22 23:03:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2020-08-22 23:03:11,563 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 69 [2020-08-22 23:03:11,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:11,563 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2020-08-22 23:03:11,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:03:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2020-08-22 23:03:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-08-22 23:03:11,565 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:11,566 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:11,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 23:03:11,566 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1298936315, now seen corresponding path program 1 times [2020-08-22 23:03:11,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:11,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120969403] [2020-08-22 23:03:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-08-22 23:03:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-08-22 23:03:11,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120969403] [2020-08-22 23:03:11,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:11,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:03:11,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796221451] [2020-08-22 23:03:11,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:03:11,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:11,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:03:11,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:03:11,665 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand 7 states. [2020-08-22 23:03:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:11,914 INFO L93 Difference]: Finished difference Result 210 states and 280 transitions. [2020-08-22 23:03:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 23:03:11,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2020-08-22 23:03:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:11,919 INFO L225 Difference]: With dead ends: 210 [2020-08-22 23:03:11,919 INFO L226 Difference]: Without dead ends: 206 [2020-08-22 23:03:11,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:03:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-08-22 23:03:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2020-08-22 23:03:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-22 23:03:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 249 transitions. [2020-08-22 23:03:11,949 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 249 transitions. Word has length 71 [2020-08-22 23:03:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:11,950 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 249 transitions. [2020-08-22 23:03:11,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:03:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 249 transitions. [2020-08-22 23:03:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-08-22 23:03:11,952 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:11,952 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:11,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 23:03:11,952 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:11,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1528474552, now seen corresponding path program 1 times [2020-08-22 23:03:11,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:11,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1660010360] [2020-08-22 23:03:11,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 23:03:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:03:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-08-22 23:03:12,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1660010360] [2020-08-22 23:03:12,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:12,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 23:03:12,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750797025] [2020-08-22 23:03:12,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 23:03:12,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 23:03:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 23:03:12,079 INFO L87 Difference]: Start difference. First operand 188 states and 249 transitions. Second operand 8 states. [2020-08-22 23:03:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:12,292 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2020-08-22 23:03:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 23:03:12,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2020-08-22 23:03:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:12,295 INFO L225 Difference]: With dead ends: 194 [2020-08-22 23:03:12,295 INFO L226 Difference]: Without dead ends: 192 [2020-08-22 23:03:12,296 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-08-22 23:03:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-08-22 23:03:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2020-08-22 23:03:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-08-22 23:03:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 252 transitions. [2020-08-22 23:03:12,322 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 252 transitions. Word has length 74 [2020-08-22 23:03:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:12,323 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 252 transitions. [2020-08-22 23:03:12,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 23:03:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 252 transitions. [2020-08-22 23:03:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-22 23:03:12,325 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:12,325 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:12,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 23:03:12,325 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1530703596, now seen corresponding path program 1 times [2020-08-22 23:03:12,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:12,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1472208993] [2020-08-22 23:03:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 23:03:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:03:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:03:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-08-22 23:03:12,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1472208993] [2020-08-22 23:03:12,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:12,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:03:12,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355765181] [2020-08-22 23:03:12,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:03:12,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:12,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:03:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:03:12,426 INFO L87 Difference]: Start difference. First operand 192 states and 252 transitions. Second operand 7 states. [2020-08-22 23:03:12,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:12,583 INFO L93 Difference]: Finished difference Result 220 states and 283 transitions. [2020-08-22 23:03:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 23:03:12,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2020-08-22 23:03:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:12,586 INFO L225 Difference]: With dead ends: 220 [2020-08-22 23:03:12,586 INFO L226 Difference]: Without dead ends: 218 [2020-08-22 23:03:12,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:03:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-08-22 23:03:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2020-08-22 23:03:12,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-08-22 23:03:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 269 transitions. [2020-08-22 23:03:12,613 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 269 transitions. Word has length 79 [2020-08-22 23:03:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:12,614 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 269 transitions. [2020-08-22 23:03:12,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:03:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 269 transitions. [2020-08-22 23:03:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-08-22 23:03:12,616 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:12,616 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:12,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 23:03:12,616 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1064000984, now seen corresponding path program 1 times [2020-08-22 23:03:12,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:12,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076470397] [2020-08-22 23:03:12,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-08-22 23:03:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-08-22 23:03:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 23:03:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-08-22 23:03:12,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076470397] [2020-08-22 23:03:12,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:12,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:03:12,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85229426] [2020-08-22 23:03:12,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:03:12,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:03:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:03:12,729 INFO L87 Difference]: Start difference. First operand 206 states and 269 transitions. Second operand 7 states. [2020-08-22 23:03:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:12,924 INFO L93 Difference]: Finished difference Result 252 states and 330 transitions. [2020-08-22 23:03:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 23:03:12,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2020-08-22 23:03:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:12,928 INFO L225 Difference]: With dead ends: 252 [2020-08-22 23:03:12,928 INFO L226 Difference]: Without dead ends: 246 [2020-08-22 23:03:12,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:03:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-08-22 23:03:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 230. [2020-08-22 23:03:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-08-22 23:03:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2020-08-22 23:03:12,956 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 81 [2020-08-22 23:03:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:12,956 INFO L479 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2020-08-22 23:03:12,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:03:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2020-08-22 23:03:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-22 23:03:12,958 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:12,958 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:12,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 23:03:12,959 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash -895183749, now seen corresponding path program 1 times [2020-08-22 23:03:12,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:12,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1043600314] [2020-08-22 23:03:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 23:03:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:03:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:03:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-08-22 23:03:13,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1043600314] [2020-08-22 23:03:13,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:13,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 23:03:13,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119863441] [2020-08-22 23:03:13,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:03:13,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:13,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:03:13,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:03:13,079 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand 10 states. [2020-08-22 23:03:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:13,385 INFO L93 Difference]: Finished difference Result 236 states and 307 transitions. [2020-08-22 23:03:13,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-22 23:03:13,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-08-22 23:03:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:13,388 INFO L225 Difference]: With dead ends: 236 [2020-08-22 23:03:13,389 INFO L226 Difference]: Without dead ends: 234 [2020-08-22 23:03:13,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2020-08-22 23:03:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-08-22 23:03:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2020-08-22 23:03:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-08-22 23:03:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 305 transitions. [2020-08-22 23:03:13,421 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 305 transitions. Word has length 90 [2020-08-22 23:03:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:13,421 INFO L479 AbstractCegarLoop]: Abstraction has 234 states and 305 transitions. [2020-08-22 23:03:13,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:03:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 305 transitions. [2020-08-22 23:03:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-08-22 23:03:13,424 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:13,424 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:13,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 23:03:13,425 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:13,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1272604239, now seen corresponding path program 1 times [2020-08-22 23:03:13,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:13,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1293377099] [2020-08-22 23:03:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 23:03:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:03:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:03:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-08-22 23:03:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-08-22 23:03:13,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1293377099] [2020-08-22 23:03:13,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:13,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 23:03:13,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065211272] [2020-08-22 23:03:13,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:03:13,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:13,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:03:13,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:03:13,593 INFO L87 Difference]: Start difference. First operand 234 states and 305 transitions. Second operand 9 states. [2020-08-22 23:03:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:13,813 INFO L93 Difference]: Finished difference Result 262 states and 335 transitions. [2020-08-22 23:03:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 23:03:13,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2020-08-22 23:03:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:13,816 INFO L225 Difference]: With dead ends: 262 [2020-08-22 23:03:13,817 INFO L226 Difference]: Without dead ends: 260 [2020-08-22 23:03:13,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-08-22 23:03:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-08-22 23:03:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 246. [2020-08-22 23:03:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-08-22 23:03:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 318 transitions. [2020-08-22 23:03:13,847 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 318 transitions. Word has length 95 [2020-08-22 23:03:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:13,848 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 318 transitions. [2020-08-22 23:03:13,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:03:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 318 transitions. [2020-08-22 23:03:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-08-22 23:03:13,850 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:13,850 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:13,851 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 23:03:13,851 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash -960498755, now seen corresponding path program 1 times [2020-08-22 23:03:13,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:13,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [494438005] [2020-08-22 23:03:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-08-22 23:03:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-08-22 23:03:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:03:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 23:03:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 23:03:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:03:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-08-22 23:03:13,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [494438005] [2020-08-22 23:03:13,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:13,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 23:03:14,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271867009] [2020-08-22 23:03:14,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:03:14,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:03:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:03:14,001 INFO L87 Difference]: Start difference. First operand 246 states and 318 transitions. Second operand 9 states. [2020-08-22 23:03:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:14,312 INFO L93 Difference]: Finished difference Result 293 states and 378 transitions. [2020-08-22 23:03:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 23:03:14,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2020-08-22 23:03:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:14,316 INFO L225 Difference]: With dead ends: 293 [2020-08-22 23:03:14,316 INFO L226 Difference]: Without dead ends: 291 [2020-08-22 23:03:14,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-08-22 23:03:14,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-08-22 23:03:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2020-08-22 23:03:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-08-22 23:03:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 349 transitions. [2020-08-22 23:03:14,344 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 349 transitions. Word has length 110 [2020-08-22 23:03:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:14,345 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 349 transitions. [2020-08-22 23:03:14,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:03:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 349 transitions. [2020-08-22 23:03:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-08-22 23:03:14,347 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:14,347 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:14,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-22 23:03:14,348 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:14,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1038471395, now seen corresponding path program 1 times [2020-08-22 23:03:14,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:14,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291163799] [2020-08-22 23:03:14,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 23:03:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:03:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:03:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-08-22 23:03:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-22 23:03:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:03:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-08-22 23:03:14,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291163799] [2020-08-22 23:03:14,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:14,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 23:03:14,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908811383] [2020-08-22 23:03:14,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:03:14,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:03:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:03:14,471 INFO L87 Difference]: Start difference. First operand 270 states and 349 transitions. Second operand 9 states. [2020-08-22 23:03:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:14,776 INFO L93 Difference]: Finished difference Result 372 states and 494 transitions. [2020-08-22 23:03:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-22 23:03:14,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2020-08-22 23:03:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:14,781 INFO L225 Difference]: With dead ends: 372 [2020-08-22 23:03:14,781 INFO L226 Difference]: Without dead ends: 368 [2020-08-22 23:03:14,782 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-08-22 23:03:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2020-08-22 23:03:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 345. [2020-08-22 23:03:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-08-22 23:03:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 458 transitions. [2020-08-22 23:03:14,817 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 458 transitions. Word has length 110 [2020-08-22 23:03:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:14,817 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 458 transitions. [2020-08-22 23:03:14,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:03:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 458 transitions. [2020-08-22 23:03:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-08-22 23:03:14,820 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:14,820 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:14,820 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-22 23:03:14,820 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:14,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1539222205, now seen corresponding path program 1 times [2020-08-22 23:03:14,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:14,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546019616] [2020-08-22 23:03:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-08-22 23:03:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-08-22 23:03:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:03:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 23:03:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 23:03:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:03:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-08-22 23:03:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-08-22 23:03:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-08-22 23:03:14,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546019616] [2020-08-22 23:03:14,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:14,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 23:03:14,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098905423] [2020-08-22 23:03:14,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:03:14,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:14,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:03:14,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:03:14,937 INFO L87 Difference]: Start difference. First operand 345 states and 458 transitions. Second operand 9 states. [2020-08-22 23:03:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:15,210 INFO L93 Difference]: Finished difference Result 379 states and 496 transitions. [2020-08-22 23:03:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 23:03:15,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2020-08-22 23:03:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:15,214 INFO L225 Difference]: With dead ends: 379 [2020-08-22 23:03:15,215 INFO L226 Difference]: Without dead ends: 377 [2020-08-22 23:03:15,216 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-08-22 23:03:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-08-22 23:03:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2020-08-22 23:03:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-08-22 23:03:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2020-08-22 23:03:15,249 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 120 [2020-08-22 23:03:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:15,250 INFO L479 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2020-08-22 23:03:15,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:03:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2020-08-22 23:03:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-08-22 23:03:15,252 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:15,252 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:15,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-22 23:03:15,253 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash 871752502, now seen corresponding path program 1 times [2020-08-22 23:03:15,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:15,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839158300] [2020-08-22 23:03:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 23:03:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:03:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:03:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-08-22 23:03:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-22 23:03:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:03:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-08-22 23:03:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-08-22 23:03:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-08-22 23:03:15,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839158300] [2020-08-22 23:03:15,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:15,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 23:03:15,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700725520] [2020-08-22 23:03:15,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 23:03:15,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:15,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 23:03:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-08-22 23:03:15,433 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 11 states. [2020-08-22 23:03:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:15,784 INFO L93 Difference]: Finished difference Result 424 states and 562 transitions. [2020-08-22 23:03:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 23:03:15,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 120 [2020-08-22 23:03:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:15,789 INFO L225 Difference]: With dead ends: 424 [2020-08-22 23:03:15,789 INFO L226 Difference]: Without dead ends: 418 [2020-08-22 23:03:15,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-08-22 23:03:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-08-22 23:03:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 398. [2020-08-22 23:03:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-08-22 23:03:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 529 transitions. [2020-08-22 23:03:15,834 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 529 transitions. Word has length 120 [2020-08-22 23:03:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:15,835 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 529 transitions. [2020-08-22 23:03:15,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 23:03:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 529 transitions. [2020-08-22 23:03:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-22 23:03:15,839 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:15,839 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:15,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-22 23:03:15,840 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1668448602, now seen corresponding path program 1 times [2020-08-22 23:03:15,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:15,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [928216234] [2020-08-22 23:03:15,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-08-22 23:03:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-08-22 23:03:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:03:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 23:03:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 23:03:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:03:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-08-22 23:03:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-08-22 23:03:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:15,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-08-22 23:03:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-08-22 23:03:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2020-08-22 23:03:16,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [928216234] [2020-08-22 23:03:16,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:16,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 23:03:16,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512459092] [2020-08-22 23:03:16,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 23:03:16,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 23:03:16,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-08-22 23:03:16,020 INFO L87 Difference]: Start difference. First operand 398 states and 529 transitions. Second operand 11 states. [2020-08-22 23:03:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:16,385 INFO L93 Difference]: Finished difference Result 432 states and 566 transitions. [2020-08-22 23:03:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 23:03:16,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2020-08-22 23:03:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:16,389 INFO L225 Difference]: With dead ends: 432 [2020-08-22 23:03:16,389 INFO L226 Difference]: Without dead ends: 430 [2020-08-22 23:03:16,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-22 23:03:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-08-22 23:03:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 410. [2020-08-22 23:03:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-08-22 23:03:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 542 transitions. [2020-08-22 23:03:16,425 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 542 transitions. Word has length 136 [2020-08-22 23:03:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:16,426 INFO L479 AbstractCegarLoop]: Abstraction has 410 states and 542 transitions. [2020-08-22 23:03:16,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 23:03:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 542 transitions. [2020-08-22 23:03:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-08-22 23:03:16,428 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:16,428 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:16,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-22 23:03:16,429 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash 362381850, now seen corresponding path program 1 times [2020-08-22 23:03:16,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:16,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578015281] [2020-08-22 23:03:16,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-08-22 23:03:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-08-22 23:03:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:03:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 23:03:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 23:03:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:03:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-08-22 23:03:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-08-22 23:03:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-08-22 23:03:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-08-22 23:03:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-08-22 23:03:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-08-22 23:03:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-08-22 23:03:16,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578015281] [2020-08-22 23:03:16,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:16,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 23:03:16,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999286422] [2020-08-22 23:03:16,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 23:03:16,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:16,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 23:03:16,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-08-22 23:03:16,602 INFO L87 Difference]: Start difference. First operand 410 states and 542 transitions. Second operand 11 states. [2020-08-22 23:03:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:17,131 INFO L93 Difference]: Finished difference Result 645 states and 888 transitions. [2020-08-22 23:03:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-22 23:03:17,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2020-08-22 23:03:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:17,159 INFO L225 Difference]: With dead ends: 645 [2020-08-22 23:03:17,159 INFO L226 Difference]: Without dead ends: 639 [2020-08-22 23:03:17,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2020-08-22 23:03:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-08-22 23:03:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 572. [2020-08-22 23:03:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2020-08-22 23:03:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 778 transitions. [2020-08-22 23:03:17,219 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 778 transitions. Word has length 151 [2020-08-22 23:03:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:17,220 INFO L479 AbstractCegarLoop]: Abstraction has 572 states and 778 transitions. [2020-08-22 23:03:17,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 23:03:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 778 transitions. [2020-08-22 23:03:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-08-22 23:03:17,223 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:17,223 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:17,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-08-22 23:03:17,223 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:17,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash -978309232, now seen corresponding path program 2 times [2020-08-22 23:03:17,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:17,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [511925536] [2020-08-22 23:03:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 23:03:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:03:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:03:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-08-22 23:03:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-22 23:03:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:03:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-08-22 23:03:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-08-22 23:03:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-08-22 23:03:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-08-22 23:03:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-08-22 23:03:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-08-22 23:03:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-08-22 23:03:17,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [511925536] [2020-08-22 23:03:17,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:17,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 23:03:17,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975933006] [2020-08-22 23:03:17,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 23:03:17,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 23:03:17,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-08-22 23:03:17,414 INFO L87 Difference]: Start difference. First operand 572 states and 778 transitions. Second operand 11 states. [2020-08-22 23:03:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:18,016 INFO L93 Difference]: Finished difference Result 647 states and 885 transitions. [2020-08-22 23:03:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-22 23:03:18,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2020-08-22 23:03:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:18,024 INFO L225 Difference]: With dead ends: 647 [2020-08-22 23:03:18,025 INFO L226 Difference]: Without dead ends: 641 [2020-08-22 23:03:18,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2020-08-22 23:03:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-08-22 23:03:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 412. [2020-08-22 23:03:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-08-22 23:03:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 539 transitions. [2020-08-22 23:03:18,086 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 539 transitions. Word has length 151 [2020-08-22 23:03:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:18,087 INFO L479 AbstractCegarLoop]: Abstraction has 412 states and 539 transitions. [2020-08-22 23:03:18,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 23:03:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 539 transitions. [2020-08-22 23:03:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-08-22 23:03:18,091 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:18,091 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:18,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-08-22 23:03:18,092 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1688386477, now seen corresponding path program 1 times [2020-08-22 23:03:18,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:18,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1892814901] [2020-08-22 23:03:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-08-22 23:03:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-08-22 23:03:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:03:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 23:03:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 23:03:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:03:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-08-22 23:03:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-08-22 23:03:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-08-22 23:03:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-08-22 23:03:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-08-22 23:03:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-08-22 23:03:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-08-22 23:03:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-08-22 23:03:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2020-08-22 23:03:18,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1892814901] [2020-08-22 23:03:18,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:18,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 23:03:18,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336456959] [2020-08-22 23:03:18,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 23:03:18,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:18,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 23:03:18,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-22 23:03:18,323 INFO L87 Difference]: Start difference. First operand 412 states and 539 transitions. Second operand 13 states. [2020-08-22 23:03:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:18,786 INFO L93 Difference]: Finished difference Result 505 states and 669 transitions. [2020-08-22 23:03:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-22 23:03:18,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2020-08-22 23:03:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:18,791 INFO L225 Difference]: With dead ends: 505 [2020-08-22 23:03:18,791 INFO L226 Difference]: Without dead ends: 495 [2020-08-22 23:03:18,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2020-08-22 23:03:18,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-08-22 23:03:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 459. [2020-08-22 23:03:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-08-22 23:03:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 603 transitions. [2020-08-22 23:03:18,858 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 603 transitions. Word has length 161 [2020-08-22 23:03:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:18,860 INFO L479 AbstractCegarLoop]: Abstraction has 459 states and 603 transitions. [2020-08-22 23:03:18,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 23:03:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 603 transitions. [2020-08-22 23:03:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-08-22 23:03:18,863 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:03:18,863 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:03:18,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-08-22 23:03:18,864 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:03:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:03:18,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1620079197, now seen corresponding path program 2 times [2020-08-22 23:03:18,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:03:18,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [648393604] [2020-08-22 23:03:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:03:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:03:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 23:03:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:03:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:03:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:03:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:18,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:03:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-08-22 23:03:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 23:03:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:03:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:03:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 23:03:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-08-22 23:03:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-22 23:03:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:03:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-08-22 23:03:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-08-22 23:03:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-08-22 23:03:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-08-22 23:03:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-08-22 23:03:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-08-22 23:03:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-08-22 23:03:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-08-22 23:03:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:03:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2020-08-22 23:03:19,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [648393604] [2020-08-22 23:03:19,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:03:19,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 23:03:19,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302696871] [2020-08-22 23:03:19,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 23:03:19,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:03:19,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 23:03:19,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-22 23:03:19,077 INFO L87 Difference]: Start difference. First operand 459 states and 603 transitions. Second operand 13 states. [2020-08-22 23:03:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:03:19,677 INFO L93 Difference]: Finished difference Result 499 states and 659 transitions. [2020-08-22 23:03:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-22 23:03:19,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2020-08-22 23:03:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:03:19,679 INFO L225 Difference]: With dead ends: 499 [2020-08-22 23:03:19,679 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 23:03:19,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2020-08-22 23:03:19,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 23:03:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 23:03:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 23:03:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 23:03:19,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2020-08-22 23:03:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:03:19,683 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 23:03:19,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 23:03:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 23:03:19,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 23:03:19,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-08-22 23:03:19,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 23:03:20,645 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2020-08-22 23:03:21,143 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2020-08-22 23:03:21,436 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2020-08-22 23:03:21,705 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 106 [2020-08-22 23:03:22,242 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 21 [2020-08-22 23:03:22,579 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2020-08-22 23:03:22,820 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 22 [2020-08-22 23:03:22,934 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 22 [2020-08-22 23:03:23,060 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 23 [2020-08-22 23:03:23,428 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 21 [2020-08-22 23:03:23,565 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2020-08-22 23:03:23,700 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 13 [2020-08-22 23:03:24,152 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 16 [2020-08-22 23:03:24,657 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 26 [2020-08-22 23:03:25,177 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 11 [2020-08-22 23:03:25,371 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 16 [2020-08-22 23:03:25,665 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 25 [2020-08-22 23:03:26,218 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 29 [2020-08-22 23:03:26,376 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 19 [2020-08-22 23:03:26,380 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 23:03:26,381 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 23:03:26,381 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 23:03:26,381 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 23:03:26,381 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 23:03:26,381 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 23:03:26,381 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-08-22 23:03:26,382 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-08-22 23:03:26,382 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-08-22 23:03:26,382 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-08-22 23:03:26,382 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-08-22 23:03:26,382 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,382 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,382 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 56) the Hoare annotation is: true [2020-08-22 23:03:26,382 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (<= (+ main_~limit~0 4) main_~bufsize~0) [2020-08-22 23:03:26,383 INFO L264 CegarLoopResult]: At program point L23-3(lines 23 54) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= main_~len~0 main_~i~0) .cse0) (and (<= 0 main_~i~0) .cse0))) [2020-08-22 23:03:26,383 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-08-22 23:03:26,383 INFO L271 CegarLoopResult]: At program point L23-4(lines 23 54) the Hoare annotation is: true [2020-08-22 23:03:26,383 INFO L271 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-08-22 23:03:26,383 INFO L271 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: true [2020-08-22 23:03:26,384 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= 0 main_~j~0)) (.cse2 (< main_~i~0 main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) .cse3) (and .cse0 .cse1 (<= main_~len~0 (+ main_~i~0 1)) .cse2 .cse3))) [2020-08-22 23:03:26,384 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-08-22 23:03:26,384 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 1 |main_#t~post6|) (<= 2 main_~j~0)) [2020-08-22 23:03:26,384 INFO L264 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 1 |main_#t~post6|) (<= 2 main_~j~0)) [2020-08-22 23:03:26,384 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,384 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,385 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,385 INFO L264 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,385 INFO L264 CegarLoopResult]: At program point L28-3(line 28) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,385 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,385 INFO L264 CegarLoopResult]: At program point L24-3(lines 24 53) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 0 main_~j~0) (<= 0 main_~i~0) .cse0) (and (<= main_~len~0 main_~i~0) .cse0))) [2020-08-22 23:03:26,385 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-08-22 23:03:26,386 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-08-22 23:03:26,386 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (<= 0 main_~j~0) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse1) (and .cse0 (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse1))) [2020-08-22 23:03:26,386 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-08-22 23:03:26,386 INFO L264 CegarLoopResult]: At program point L45(lines 25 52) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,386 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-08-22 23:03:26,386 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-08-22 23:03:26,387 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,387 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (<= (+ |main_#t~post3| 5) main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 |main_#t~post3|) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,387 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (and (<= (+ |main_#t~post3| 5) main_~bufsize~0) (<= 1 main_~j~0) (<= 0 |main_#t~post3|) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,387 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,387 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,387 INFO L264 CegarLoopResult]: At program point L25(lines 25 52) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,388 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-08-22 23:03:26,388 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-08-22 23:03:26,388 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-08-22 23:03:26,388 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (<= 0 main_~j~0) (<= 0 |main_#t~post8|) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse1) (and .cse0 (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse1))) [2020-08-22 23:03:26,388 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-08-22 23:03:26,388 INFO L264 CegarLoopResult]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse0) (and (<= 1 main_~j~0) (<= 0 |main_#t~post8|) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse0))) [2020-08-22 23:03:26,389 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,389 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 56) the Hoare annotation is: true [2020-08-22 23:03:26,389 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-08-22 23:03:26,389 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,389 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= 1 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,389 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (<= 1 main_~j~0) (<= 0 |main_#t~post4|) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ |main_#t~post4| 2) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,390 INFO L264 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= 0 |main_#t~post4|) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ |main_#t~post4| 2) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,390 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,390 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 56) the Hoare annotation is: true [2020-08-22 23:03:26,390 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,390 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,390 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-08-22 23:03:26,390 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse0) (and (<= 1 main_~j~0) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse0))) [2020-08-22 23:03:26,391 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-08-22 23:03:26,391 INFO L264 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= main_~len~0 (+ |main_#t~post9| 1)) (<= main_~len~0 (+ main_~i~0 1)) (< main_~i~0 main_~len~0) .cse0) (and (<= 1 main_~j~0) (<= 0 |main_#t~post9|) (<= (+ main_~i~0 2) main_~len~0) (<= 0 main_~i~0) .cse0))) [2020-08-22 23:03:26,391 INFO L264 CegarLoopResult]: At program point L51-2(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 1 main_~j~0) (<= 0 |main_#t~post9|) (<= 1 main_~i~0) .cse0) (and (<= main_~len~0 (+ |main_#t~post9| 1)) (<= main_~len~0 main_~i~0) .cse0))) [2020-08-22 23:03:26,391 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= 0 main_~j~0)) (.cse2 (< main_~i~0 main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) .cse3) (and .cse0 .cse1 (<= main_~len~0 (+ main_~i~0 1)) .cse2 .cse3))) [2020-08-22 23:03:26,391 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= 2 |main_#t~post7|)) [2020-08-22 23:03:26,391 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (<= 3 main_~j~0) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 |main_#t~post7|)) [2020-08-22 23:03:26,392 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 1 |main_#t~post5|) (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ |main_#t~post5| 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,392 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 1 |main_#t~post5|) (<= (+ main_~j~0 3) main_~bufsize~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ |main_#t~post5| 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-08-22 23:03:26,392 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,392 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-08-22 23:03:26,392 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-08-22 23:03:26,392 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 23:03:26,392 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 23:03:26,393 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 23:03:26,393 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 23:03:26,393 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 23:03:26,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 11:03:26 BoogieIcfgContainer [2020-08-22 23:03:26,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 23:03:26,421 INFO L168 Benchmark]: Toolchain (without parser) took 18582.12 ms. Allocated memory was 137.4 MB in the beginning and 472.9 MB in the end (delta: 335.5 MB). Free memory was 101.7 MB in the beginning and 430.2 MB in the end (delta: -328.6 MB). Peak memory consumption was 330.9 MB. Max. memory is 7.1 GB. [2020-08-22 23:03:26,422 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 23:03:26,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.28 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 91.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-08-22 23:03:26,423 INFO L168 Benchmark]: Boogie Preprocessor took 139.16 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 91.4 MB in the beginning and 178.8 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-08-22 23:03:26,423 INFO L168 Benchmark]: RCFGBuilder took 483.45 ms. Allocated memory is still 200.8 MB. Free memory was 178.8 MB in the beginning and 160.0 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2020-08-22 23:03:26,424 INFO L168 Benchmark]: TraceAbstraction took 17698.90 ms. Allocated memory was 200.8 MB in the beginning and 472.9 MB in the end (delta: 272.1 MB). Free memory was 160.0 MB in the beginning and 430.2 MB in the end (delta: -270.3 MB). Peak memory consumption was 325.8 MB. Max. memory is 7.1 GB. [2020-08-22 23:03:26,427 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.26 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 255.28 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 91.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.16 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 91.4 MB in the beginning and 178.8 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 483.45 ms. Allocated memory is still 200.8 MB. Free memory was 178.8 MB in the beginning and 160.0 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17698.90 ms. Allocated memory was 200.8 MB in the beginning and 472.9 MB in the end (delta: 272.1 MB). Free memory was 160.0 MB in the beginning and 430.2 MB in the end (delta: -270.3 MB). Peak memory consumption was 325.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((j + 5 <= bufsize && 0 <= j) && i < len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (len <= i && limit + 4 <= bufsize) || (0 <= i && limit + 4 <= bufsize) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((0 <= j && 0 <= i) && limit + 4 <= bufsize) || (len <= i && limit + 4 <= bufsize) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.9s, OverallIterations: 23, TraceHistogramMax: 22, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2525 SDtfs, 852 SDslu, 11733 SDs, 0 SdLazy, 3758 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 810 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=572occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 542 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 1484 PreInvPairs, 2305 NumberOfFragments, 1188 HoareAnnotationTreeSize, 1484 FomulaSimplifications, 3109982 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 74 FomulaSimplificationsInter, 884914 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2056 NumberOfCodeBlocks, 2056 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2033 ConstructedInterpolants, 0 QuantifiedInterpolants, 394477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 6694/6694 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...