/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/bitvector/soft_float_5a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:37:27,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:37:27,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:37:27,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:37:27,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:37:27,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:37:27,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:37:27,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:37:27,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:37:27,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:37:27,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:37:27,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:37:27,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:37:27,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:37:27,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:37:27,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:37:27,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:37:27,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:37:27,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:37:27,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:37:27,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:37:27,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:37:27,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:37:27,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:37:27,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:37:27,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:37:27,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:37:27,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:37:27,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:37:27,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:37:27,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:37:27,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:37:27,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:37:27,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:37:27,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:37:27,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:37:27,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:37:27,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:37:27,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:37:27,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:37:27,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:37:27,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:37:27,120 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:37:27,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:37:27,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:37:27,125 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:37:27,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:37:27,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:37:27,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:37:27,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:37:27,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:37:27,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:37:27,126 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:37:27,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:37:27,127 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:37:27,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:37:27,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:37:27,127 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:37:27,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:37:27,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:37:27,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:37:27,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:37:27,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:37:27,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:37:27,130 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-09-04 21:37:27,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:37:27,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:37:27,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:37:27,593 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:37:27,594 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:37:27,595 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2020-09-04 21:37:27,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2f18e3d9c/6d07ebe6c1fc4543aa40326c3037e1d6/FLAGa033c0b1b [2020-09-04 21:37:28,206 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:37:28,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2020-09-04 21:37:28,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2f18e3d9c/6d07ebe6c1fc4543aa40326c3037e1d6/FLAGa033c0b1b [2020-09-04 21:37:28,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2f18e3d9c/6d07ebe6c1fc4543aa40326c3037e1d6 [2020-09-04 21:37:28,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:37:28,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:37:28,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:37:28,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:37:28,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:37:28,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:37:28" (1/1) ... [2020-09-04 21:37:28,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2acd657e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:28, skipping insertion in model container [2020-09-04 21:37:28,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:37:28" (1/1) ... [2020-09-04 21:37:28,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:37:28,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:37:28,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:37:28,905 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:37:29,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:37:29,076 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:37:29,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29 WrapperNode [2020-09-04 21:37:29,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:37:29,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:37:29,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:37:29,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:37:29,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29" (1/1) ... [2020-09-04 21:37:29,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29" (1/1) ... [2020-09-04 21:37:29,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29" (1/1) ... [2020-09-04 21:37:29,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29" (1/1) ... [2020-09-04 21:37:29,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29" (1/1) ... [2020-09-04 21:37:29,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29" (1/1) ... [2020-09-04 21:37:29,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29" (1/1) ... [2020-09-04 21:37:29,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:37:29,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:37:29,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:37:29,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:37:29,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 21:37:29,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:37:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:37:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 21:37:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2020-09-04 21:37:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2020-09-04 21:37:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2020-09-04 21:37:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:37:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:37:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 21:37:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 21:37:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 21:37:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2020-09-04 21:37:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2020-09-04 21:37:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2020-09-04 21:37:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:37:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:37:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:37:29,797 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:37:29,797 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 21:37:29,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:37:29 BoogieIcfgContainer [2020-09-04 21:37:29,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:37:29,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:37:29,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:37:29,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:37:29,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:37:28" (1/3) ... [2020-09-04 21:37:29,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd9ad53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:37:29, skipping insertion in model container [2020-09-04 21:37:29,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:29" (2/3) ... [2020-09-04 21:37:29,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd9ad53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:37:29, skipping insertion in model container [2020-09-04 21:37:29,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:37:29" (3/3) ... [2020-09-04 21:37:29,814 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2020-09-04 21:37:29,826 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:37:29,836 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:37:29,856 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:37:29,886 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:37:29,886 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:37:29,887 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:37:29,887 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:37:29,887 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:37:29,887 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:37:29,887 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:37:29,888 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:37:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2020-09-04 21:37:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-09-04 21:37:29,931 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:29,932 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:29,933 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2062280112, now seen corresponding path program 1 times [2020-09-04 21:37:29,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:29,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [936177425] [2020-09-04 21:37:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 21:37:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 21:37:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 21:37:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:30,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [936177425] [2020-09-04 21:37:30,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:30,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-09-04 21:37:30,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492435733] [2020-09-04 21:37:30,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 21:37:30,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:30,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 21:37:30,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 21:37:30,379 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2020-09-04 21:37:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:30,655 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2020-09-04 21:37:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:37:30,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-09-04 21:37:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:30,686 INFO L225 Difference]: With dead ends: 286 [2020-09-04 21:37:30,687 INFO L226 Difference]: Without dead ends: 168 [2020-09-04 21:37:30,694 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-09-04 21:37:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 145. [2020-09-04 21:37:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-04 21:37:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2020-09-04 21:37:30,780 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 100 [2020-09-04 21:37:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:30,781 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2020-09-04 21:37:30,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 21:37:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2020-09-04 21:37:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-04 21:37:30,788 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:30,788 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:30,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:37:30,789 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1947593625, now seen corresponding path program 1 times [2020-09-04 21:37:30,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:30,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1067396181] [2020-09-04 21:37:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:37:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 21:37:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 21:37:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:30,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1067396181] [2020-09-04 21:37:30,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:30,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-09-04 21:37:30,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409585480] [2020-09-04 21:37:30,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 21:37:30,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:30,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 21:37:30,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 21:37:30,964 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand 4 states. [2020-09-04 21:37:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:31,068 INFO L93 Difference]: Finished difference Result 278 states and 331 transitions. [2020-09-04 21:37:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 21:37:31,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-09-04 21:37:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:31,073 INFO L225 Difference]: With dead ends: 278 [2020-09-04 21:37:31,073 INFO L226 Difference]: Without dead ends: 169 [2020-09-04 21:37:31,075 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-09-04 21:37:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2020-09-04 21:37:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-09-04 21:37:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2020-09-04 21:37:31,105 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 103 [2020-09-04 21:37:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:31,105 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2020-09-04 21:37:31,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 21:37:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2020-09-04 21:37:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 21:37:31,110 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:31,111 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:31,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:37:31,111 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1622356113, now seen corresponding path program 1 times [2020-09-04 21:37:31,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:31,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [537413905] [2020-09-04 21:37:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 21:37:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 21:37:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 21:37:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:31,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [537413905] [2020-09-04 21:37:31,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:31,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 21:37:31,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739756604] [2020-09-04 21:37:31,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:37:31,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:31,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:37:31,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:31,301 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. Second operand 5 states. [2020-09-04 21:37:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:31,407 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2020-09-04 21:37:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:37:31,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-04 21:37:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:31,410 INFO L225 Difference]: With dead ends: 314 [2020-09-04 21:37:31,411 INFO L226 Difference]: Without dead ends: 192 [2020-09-04 21:37:31,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-09-04 21:37:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 173. [2020-09-04 21:37:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-09-04 21:37:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2020-09-04 21:37:31,437 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 108 [2020-09-04 21:37:31,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:31,438 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2020-09-04 21:37:31,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:37:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2020-09-04 21:37:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 21:37:31,443 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:31,444 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:31,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:37:31,444 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:31,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1409900093, now seen corresponding path program 1 times [2020-09-04 21:37:31,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:31,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400448293] [2020-09-04 21:37:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 21:37:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 21:37:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 21:37:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:31,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400448293] [2020-09-04 21:37:31,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:31,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 21:37:31,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112556530] [2020-09-04 21:37:31,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:37:31,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:31,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:37:31,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:31,685 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 5 states. [2020-09-04 21:37:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:31,818 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2020-09-04 21:37:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:37:31,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-04 21:37:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:31,823 INFO L225 Difference]: With dead ends: 314 [2020-09-04 21:37:31,823 INFO L226 Difference]: Without dead ends: 194 [2020-09-04 21:37:31,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-09-04 21:37:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2020-09-04 21:37:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-09-04 21:37:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 207 transitions. [2020-09-04 21:37:31,871 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 207 transitions. Word has length 108 [2020-09-04 21:37:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:31,872 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 207 transitions. [2020-09-04 21:37:31,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:37:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 207 transitions. [2020-09-04 21:37:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 21:37:31,877 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:31,878 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:31,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:37:31,879 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2129807001, now seen corresponding path program 2 times [2020-09-04 21:37:31,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:31,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1161984196] [2020-09-04 21:37:31,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 21:37:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 21:37:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 21:37:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:32,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1161984196] [2020-09-04 21:37:32,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:32,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:37:32,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767132833] [2020-09-04 21:37:32,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:37:32,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:32,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:37:32,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:32,082 INFO L87 Difference]: Start difference. First operand 176 states and 207 transitions. Second operand 6 states. [2020-09-04 21:37:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:32,194 INFO L93 Difference]: Finished difference Result 348 states and 416 transitions. [2020-09-04 21:37:32,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:37:32,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-09-04 21:37:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:32,201 INFO L225 Difference]: With dead ends: 348 [2020-09-04 21:37:32,201 INFO L226 Difference]: Without dead ends: 218 [2020-09-04 21:37:32,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:37:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-09-04 21:37:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 186. [2020-09-04 21:37:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-04 21:37:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2020-09-04 21:37:32,234 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 113 [2020-09-04 21:37:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:32,236 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2020-09-04 21:37:32,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:37:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2020-09-04 21:37:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 21:37:32,244 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:32,244 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:32,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:37:32,244 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash -902449205, now seen corresponding path program 1 times [2020-09-04 21:37:32,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:32,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1238180186] [2020-09-04 21:37:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 21:37:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 21:37:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 21:37:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:32,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1238180186] [2020-09-04 21:37:32,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:32,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:37:32,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771673238] [2020-09-04 21:37:32,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:37:32,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:32,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:37:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:32,438 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 6 states. [2020-09-04 21:37:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:32,562 INFO L93 Difference]: Finished difference Result 342 states and 410 transitions. [2020-09-04 21:37:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:37:32,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-09-04 21:37:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:32,565 INFO L225 Difference]: With dead ends: 342 [2020-09-04 21:37:32,566 INFO L226 Difference]: Without dead ends: 214 [2020-09-04 21:37:32,567 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:37:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-09-04 21:37:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 186. [2020-09-04 21:37:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-04 21:37:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2020-09-04 21:37:32,606 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 113 [2020-09-04 21:37:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:32,608 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2020-09-04 21:37:32,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:37:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2020-09-04 21:37:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-04 21:37:32,612 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:32,613 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:32,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:37:32,613 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:32,614 INFO L82 PathProgramCache]: Analyzing trace with hash 139965841, now seen corresponding path program 3 times [2020-09-04 21:37:32,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:32,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190193427] [2020-09-04 21:37:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 21:37:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 21:37:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 21:37:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:32,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190193427] [2020-09-04 21:37:32,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:32,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:37:32,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897982767] [2020-09-04 21:37:32,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:37:32,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:37:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:37:32,775 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 7 states. [2020-09-04 21:37:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:32,906 INFO L93 Difference]: Finished difference Result 375 states and 449 transitions. [2020-09-04 21:37:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:37:32,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2020-09-04 21:37:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:32,911 INFO L225 Difference]: With dead ends: 375 [2020-09-04 21:37:32,911 INFO L226 Difference]: Without dead ends: 240 [2020-09-04 21:37:32,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:37:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-09-04 21:37:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 196. [2020-09-04 21:37:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-09-04 21:37:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-09-04 21:37:32,937 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 118 [2020-09-04 21:37:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:32,937 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-09-04 21:37:32,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:37:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-09-04 21:37:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-04 21:37:32,939 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:32,940 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:32,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:37:32,940 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:32,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1402676931, now seen corresponding path program 2 times [2020-09-04 21:37:32,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:32,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [834937432] [2020-09-04 21:37:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 21:37:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 21:37:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 21:37:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:33,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [834937432] [2020-09-04 21:37:33,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:33,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:37:33,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30655318] [2020-09-04 21:37:33,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:37:33,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:33,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:37:33,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:37:33,138 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 7 states. [2020-09-04 21:37:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:33,314 INFO L93 Difference]: Finished difference Result 361 states and 435 transitions. [2020-09-04 21:37:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:37:33,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2020-09-04 21:37:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:33,318 INFO L225 Difference]: With dead ends: 361 [2020-09-04 21:37:33,319 INFO L226 Difference]: Without dead ends: 228 [2020-09-04 21:37:33,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:37:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-09-04 21:37:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 196. [2020-09-04 21:37:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-09-04 21:37:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-09-04 21:37:33,351 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 118 [2020-09-04 21:37:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:33,352 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-09-04 21:37:33,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:37:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-09-04 21:37:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:37:33,354 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:33,354 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:33,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:37:33,355 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:33,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:33,355 INFO L82 PathProgramCache]: Analyzing trace with hash -229056103, now seen corresponding path program 4 times [2020-09-04 21:37:33,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:33,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [886126969] [2020-09-04 21:37:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 21:37:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 21:37:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-04 21:37:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:33,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [886126969] [2020-09-04 21:37:33,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:33,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:37:33,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705913257] [2020-09-04 21:37:33,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:37:33,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:37:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:37:33,517 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 8 states. [2020-09-04 21:37:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:33,675 INFO L93 Difference]: Finished difference Result 402 states and 482 transitions. [2020-09-04 21:37:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:37:33,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-04 21:37:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:33,679 INFO L225 Difference]: With dead ends: 402 [2020-09-04 21:37:33,679 INFO L226 Difference]: Without dead ends: 262 [2020-09-04 21:37:33,681 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:37:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-09-04 21:37:33,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 206. [2020-09-04 21:37:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 21:37:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2020-09-04 21:37:33,707 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 123 [2020-09-04 21:37:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:33,708 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2020-09-04 21:37:33,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:37:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2020-09-04 21:37:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:37:33,710 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:33,710 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:33,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:37:33,711 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1033654987, now seen corresponding path program 3 times [2020-09-04 21:37:33,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:33,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1264727956] [2020-09-04 21:37:33,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 21:37:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 21:37:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-04 21:37:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:33,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1264727956] [2020-09-04 21:37:33,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:33,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:37:33,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913966571] [2020-09-04 21:37:33,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:37:33,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:33,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:37:33,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:37:33,952 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand 8 states. [2020-09-04 21:37:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:34,169 INFO L93 Difference]: Finished difference Result 380 states and 460 transitions. [2020-09-04 21:37:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:37:34,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-04 21:37:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:34,183 INFO L225 Difference]: With dead ends: 380 [2020-09-04 21:37:34,184 INFO L226 Difference]: Without dead ends: 242 [2020-09-04 21:37:34,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:37:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-09-04 21:37:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 206. [2020-09-04 21:37:34,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 21:37:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2020-09-04 21:37:34,205 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 123 [2020-09-04 21:37:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:34,205 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2020-09-04 21:37:34,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:37:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2020-09-04 21:37:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 21:37:34,207 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:34,208 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:34,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:37:34,208 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1138358929, now seen corresponding path program 5 times [2020-09-04 21:37:34,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:34,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187759868] [2020-09-04 21:37:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 21:37:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 21:37:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 21:37:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:34,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187759868] [2020-09-04 21:37:34,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:34,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:37:34,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613315395] [2020-09-04 21:37:34,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:37:34,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:34,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:37:34,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:37:34,367 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand 9 states. [2020-09-04 21:37:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:34,527 INFO L93 Difference]: Finished difference Result 429 states and 515 transitions. [2020-09-04 21:37:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:37:34,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-09-04 21:37:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:34,530 INFO L225 Difference]: With dead ends: 429 [2020-09-04 21:37:34,530 INFO L226 Difference]: Without dead ends: 284 [2020-09-04 21:37:34,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:37:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-09-04 21:37:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 216. [2020-09-04 21:37:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-09-04 21:37:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2020-09-04 21:37:34,553 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 128 [2020-09-04 21:37:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:34,554 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2020-09-04 21:37:34,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:37:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2020-09-04 21:37:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 21:37:34,556 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:34,556 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:34,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:37:34,557 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1893897277, now seen corresponding path program 4 times [2020-09-04 21:37:34,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:34,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1103096891] [2020-09-04 21:37:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 21:37:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 21:37:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 21:37:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:34,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1103096891] [2020-09-04 21:37:34,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:34,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:37:34,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610179046] [2020-09-04 21:37:34,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:37:34,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:34,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:37:34,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:37:34,764 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand 9 states. [2020-09-04 21:37:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:34,969 INFO L93 Difference]: Finished difference Result 399 states and 485 transitions. [2020-09-04 21:37:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:37:34,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-09-04 21:37:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:34,971 INFO L225 Difference]: With dead ends: 399 [2020-09-04 21:37:34,972 INFO L226 Difference]: Without dead ends: 256 [2020-09-04 21:37:34,973 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:37:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-09-04 21:37:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 216. [2020-09-04 21:37:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-09-04 21:37:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2020-09-04 21:37:34,993 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 128 [2020-09-04 21:37:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:34,993 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2020-09-04 21:37:34,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:37:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2020-09-04 21:37:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 21:37:34,995 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:34,996 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:34,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:37:34,996 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:34,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:34,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1450818713, now seen corresponding path program 6 times [2020-09-04 21:37:34,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:34,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [231204098] [2020-09-04 21:37:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:37:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 21:37:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 21:37:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 99 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:35,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [231204098] [2020-09-04 21:37:35,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:35,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:37:35,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806555657] [2020-09-04 21:37:35,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:37:35,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:35,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:37:35,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:37:35,193 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand 10 states. [2020-09-04 21:37:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:35,434 INFO L93 Difference]: Finished difference Result 456 states and 548 transitions. [2020-09-04 21:37:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:37:35,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-09-04 21:37:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:35,437 INFO L225 Difference]: With dead ends: 456 [2020-09-04 21:37:35,437 INFO L226 Difference]: Without dead ends: 306 [2020-09-04 21:37:35,439 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:37:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-09-04 21:37:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 226. [2020-09-04 21:37:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-09-04 21:37:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 272 transitions. [2020-09-04 21:37:35,472 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 272 transitions. Word has length 133 [2020-09-04 21:37:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:35,472 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 272 transitions. [2020-09-04 21:37:35,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:37:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 272 transitions. [2020-09-04 21:37:35,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 21:37:35,476 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:35,477 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:35,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:37:35,477 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:35,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1581437493, now seen corresponding path program 5 times [2020-09-04 21:37:35,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:35,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1635360773] [2020-09-04 21:37:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:37:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 21:37:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 21:37:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 7 proven. 89 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:35,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1635360773] [2020-09-04 21:37:35,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:35,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:37:35,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129648309] [2020-09-04 21:37:35,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:37:35,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:37:35,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:37:35,803 INFO L87 Difference]: Start difference. First operand 226 states and 272 transitions. Second operand 10 states. [2020-09-04 21:37:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:36,126 INFO L93 Difference]: Finished difference Result 418 states and 510 transitions. [2020-09-04 21:37:36,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:37:36,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-09-04 21:37:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:36,130 INFO L225 Difference]: With dead ends: 418 [2020-09-04 21:37:36,130 INFO L226 Difference]: Without dead ends: 270 [2020-09-04 21:37:36,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:37:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-09-04 21:37:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 226. [2020-09-04 21:37:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-09-04 21:37:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 272 transitions. [2020-09-04 21:37:36,165 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 272 transitions. Word has length 133 [2020-09-04 21:37:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:36,165 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 272 transitions. [2020-09-04 21:37:36,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:37:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 272 transitions. [2020-09-04 21:37:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 21:37:36,169 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:36,169 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:36,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:37:36,170 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:36,170 INFO L82 PathProgramCache]: Analyzing trace with hash 688521105, now seen corresponding path program 7 times [2020-09-04 21:37:36,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:36,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [913091557] [2020-09-04 21:37:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 21:37:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 21:37:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 21:37:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 131 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:36,402 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [913091557] [2020-09-04 21:37:36,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:36,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:37:36,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787209263] [2020-09-04 21:37:36,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:37:36,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:36,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:37:36,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:37:36,404 INFO L87 Difference]: Start difference. First operand 226 states and 272 transitions. Second operand 11 states. [2020-09-04 21:37:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:36,563 INFO L93 Difference]: Finished difference Result 483 states and 581 transitions. [2020-09-04 21:37:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:37:36,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2020-09-04 21:37:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:36,566 INFO L225 Difference]: With dead ends: 483 [2020-09-04 21:37:36,567 INFO L226 Difference]: Without dead ends: 328 [2020-09-04 21:37:36,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:37:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-09-04 21:37:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 236. [2020-09-04 21:37:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 21:37:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2020-09-04 21:37:36,593 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 138 [2020-09-04 21:37:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:36,593 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2020-09-04 21:37:36,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:37:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2020-09-04 21:37:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 21:37:36,595 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:36,595 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:36,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:37:36,596 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:36,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1951232195, now seen corresponding path program 6 times [2020-09-04 21:37:36,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:36,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1277720606] [2020-09-04 21:37:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 21:37:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 21:37:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 21:37:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:36,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1277720606] [2020-09-04 21:37:36,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:36,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:37:36,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13580143] [2020-09-04 21:37:36,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:37:36,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:37:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:37:36,873 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 11 states. [2020-09-04 21:37:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:37,234 INFO L93 Difference]: Finished difference Result 437 states and 535 transitions. [2020-09-04 21:37:37,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:37:37,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2020-09-04 21:37:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:37,237 INFO L225 Difference]: With dead ends: 437 [2020-09-04 21:37:37,237 INFO L226 Difference]: Without dead ends: 284 [2020-09-04 21:37:37,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:37:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-09-04 21:37:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2020-09-04 21:37:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 21:37:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2020-09-04 21:37:37,278 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 138 [2020-09-04 21:37:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:37,279 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2020-09-04 21:37:37,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:37:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2020-09-04 21:37:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-04 21:37:37,283 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:37,284 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:37,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:37:37,284 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1216030823, now seen corresponding path program 8 times [2020-09-04 21:37:37,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:37,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [986863686] [2020-09-04 21:37:37,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 21:37:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 21:37:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 21:37:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:37,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [986863686] [2020-09-04 21:37:37,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:37,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:37:37,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579023172] [2020-09-04 21:37:37,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:37:37,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:37,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:37:37,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:37:37,630 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 12 states. [2020-09-04 21:37:37,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:37,961 INFO L93 Difference]: Finished difference Result 510 states and 614 transitions. [2020-09-04 21:37:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:37:37,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-09-04 21:37:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:37,969 INFO L225 Difference]: With dead ends: 510 [2020-09-04 21:37:37,969 INFO L226 Difference]: Without dead ends: 350 [2020-09-04 21:37:37,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:37:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-09-04 21:37:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 246. [2020-09-04 21:37:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-09-04 21:37:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 298 transitions. [2020-09-04 21:37:38,013 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 298 transitions. Word has length 143 [2020-09-04 21:37:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:38,014 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 298 transitions. [2020-09-04 21:37:38,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:37:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 298 transitions. [2020-09-04 21:37:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-04 21:37:38,018 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:38,018 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:38,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 21:37:38,019 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:38,020 INFO L82 PathProgramCache]: Analyzing trace with hash 46680267, now seen corresponding path program 7 times [2020-09-04 21:37:38,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:38,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [80667172] [2020-09-04 21:37:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 21:37:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 21:37:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 21:37:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 7 proven. 154 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:38,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [80667172] [2020-09-04 21:37:38,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:38,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:37:38,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132055262] [2020-09-04 21:37:38,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:37:38,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:37:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:37:38,408 INFO L87 Difference]: Start difference. First operand 246 states and 298 transitions. Second operand 12 states. [2020-09-04 21:37:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:38,719 INFO L93 Difference]: Finished difference Result 456 states and 560 transitions. [2020-09-04 21:37:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:37:38,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-09-04 21:37:38,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:38,722 INFO L225 Difference]: With dead ends: 456 [2020-09-04 21:37:38,723 INFO L226 Difference]: Without dead ends: 298 [2020-09-04 21:37:38,724 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:37:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-09-04 21:37:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 246. [2020-09-04 21:37:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-09-04 21:37:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 298 transitions. [2020-09-04 21:37:38,751 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 298 transitions. Word has length 143 [2020-09-04 21:37:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:38,751 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 298 transitions. [2020-09-04 21:37:38,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:37:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 298 transitions. [2020-09-04 21:37:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 21:37:38,755 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:38,755 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:38,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 21:37:38,755 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash -910703471, now seen corresponding path program 9 times [2020-09-04 21:37:38,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:38,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1332438464] [2020-09-04 21:37:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-04 21:37:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-09-04 21:37:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 21:37:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:39,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1332438464] [2020-09-04 21:37:39,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:39,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:37:39,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931476628] [2020-09-04 21:37:39,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:37:39,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:39,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:37:39,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:37:39,025 INFO L87 Difference]: Start difference. First operand 246 states and 298 transitions. Second operand 13 states. [2020-09-04 21:37:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:39,314 INFO L93 Difference]: Finished difference Result 537 states and 647 transitions. [2020-09-04 21:37:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:37:39,315 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2020-09-04 21:37:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:39,320 INFO L225 Difference]: With dead ends: 537 [2020-09-04 21:37:39,320 INFO L226 Difference]: Without dead ends: 372 [2020-09-04 21:37:39,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:37:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-09-04 21:37:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 256. [2020-09-04 21:37:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 21:37:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2020-09-04 21:37:39,369 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 148 [2020-09-04 21:37:39,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:39,370 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2020-09-04 21:37:39,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:37:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2020-09-04 21:37:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 21:37:39,372 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:39,372 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:39,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 21:37:39,373 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash 352007619, now seen corresponding path program 8 times [2020-09-04 21:37:39,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:39,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525557070] [2020-09-04 21:37:39,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-04 21:37:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-09-04 21:37:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 21:37:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 7 proven. 194 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:39,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525557070] [2020-09-04 21:37:39,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:39,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:37:39,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923370467] [2020-09-04 21:37:39,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:37:39,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:39,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:37:39,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:37:39,777 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand 13 states. [2020-09-04 21:37:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:40,144 INFO L93 Difference]: Finished difference Result 475 states and 585 transitions. [2020-09-04 21:37:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:37:40,144 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2020-09-04 21:37:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:40,147 INFO L225 Difference]: With dead ends: 475 [2020-09-04 21:37:40,147 INFO L226 Difference]: Without dead ends: 312 [2020-09-04 21:37:40,148 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:37:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-09-04 21:37:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 256. [2020-09-04 21:37:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 21:37:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2020-09-04 21:37:40,172 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 148 [2020-09-04 21:37:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:40,172 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2020-09-04 21:37:40,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:37:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2020-09-04 21:37:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 21:37:40,174 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:40,175 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:40,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 21:37:40,175 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1515572583, now seen corresponding path program 10 times [2020-09-04 21:37:40,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:40,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2142826728] [2020-09-04 21:37:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 21:37:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 21:37:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 21:37:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 6 proven. 257 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:40,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2142826728] [2020-09-04 21:37:40,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:40,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:37:40,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107300377] [2020-09-04 21:37:40,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:37:40,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:40,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:37:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:37:40,466 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand 14 states. [2020-09-04 21:37:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:40,695 INFO L93 Difference]: Finished difference Result 564 states and 680 transitions. [2020-09-04 21:37:40,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:37:40,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2020-09-04 21:37:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:40,699 INFO L225 Difference]: With dead ends: 564 [2020-09-04 21:37:40,699 INFO L226 Difference]: Without dead ends: 394 [2020-09-04 21:37:40,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:37:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-09-04 21:37:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 266. [2020-09-04 21:37:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-09-04 21:37:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2020-09-04 21:37:40,743 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 153 [2020-09-04 21:37:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:40,744 INFO L479 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2020-09-04 21:37:40,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:37:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2020-09-04 21:37:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 21:37:40,746 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:40,747 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:40,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 21:37:40,749 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash -252861493, now seen corresponding path program 9 times [2020-09-04 21:37:40,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:40,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082373815] [2020-09-04 21:37:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 21:37:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 21:37:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 21:37:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 7 proven. 239 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:41,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082373815] [2020-09-04 21:37:41,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:41,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:37:41,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019591170] [2020-09-04 21:37:41,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:37:41,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:37:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:37:41,217 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand 14 states. [2020-09-04 21:37:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:41,754 INFO L93 Difference]: Finished difference Result 494 states and 610 transitions. [2020-09-04 21:37:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:37:41,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2020-09-04 21:37:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:41,757 INFO L225 Difference]: With dead ends: 494 [2020-09-04 21:37:41,758 INFO L226 Difference]: Without dead ends: 326 [2020-09-04 21:37:41,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:37:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-09-04 21:37:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2020-09-04 21:37:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-09-04 21:37:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2020-09-04 21:37:41,790 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 153 [2020-09-04 21:37:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:41,790 INFO L479 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2020-09-04 21:37:41,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:37:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2020-09-04 21:37:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-04 21:37:41,792 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:41,793 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:41,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 21:37:41,793 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:41,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash 867387793, now seen corresponding path program 11 times [2020-09-04 21:37:41,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:41,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2029277867] [2020-09-04 21:37:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 21:37:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 21:37:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 21:37:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 6 proven. 309 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:42,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2029277867] [2020-09-04 21:37:42,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:42,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:37:42,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871772403] [2020-09-04 21:37:42,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:37:42,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:37:42,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:37:42,120 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand 15 states. [2020-09-04 21:37:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:42,439 INFO L93 Difference]: Finished difference Result 591 states and 713 transitions. [2020-09-04 21:37:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:37:42,439 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2020-09-04 21:37:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:42,442 INFO L225 Difference]: With dead ends: 591 [2020-09-04 21:37:42,443 INFO L226 Difference]: Without dead ends: 416 [2020-09-04 21:37:42,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:37:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-09-04 21:37:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 276. [2020-09-04 21:37:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-09-04 21:37:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2020-09-04 21:37:42,480 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 158 [2020-09-04 21:37:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:42,481 INFO L479 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2020-09-04 21:37:42,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:37:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2020-09-04 21:37:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-04 21:37:42,483 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:42,483 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:42,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 21:37:42,484 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:42,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2130098883, now seen corresponding path program 10 times [2020-09-04 21:37:42,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:42,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345100524] [2020-09-04 21:37:42,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 21:37:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 21:37:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 21:37:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 289 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:42,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345100524] [2020-09-04 21:37:42,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:42,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:37:42,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302038557] [2020-09-04 21:37:42,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:37:42,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:37:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:37:42,868 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand 15 states. [2020-09-04 21:37:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:43,354 INFO L93 Difference]: Finished difference Result 513 states and 635 transitions. [2020-09-04 21:37:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:37:43,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2020-09-04 21:37:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:43,357 INFO L225 Difference]: With dead ends: 513 [2020-09-04 21:37:43,357 INFO L226 Difference]: Without dead ends: 340 [2020-09-04 21:37:43,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:37:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-09-04 21:37:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 276. [2020-09-04 21:37:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-09-04 21:37:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2020-09-04 21:37:43,392 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 158 [2020-09-04 21:37:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:43,392 INFO L479 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2020-09-04 21:37:43,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:37:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2020-09-04 21:37:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-04 21:37:43,398 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:43,398 INFO L422 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:43,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 21:37:43,400 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:43,401 INFO L82 PathProgramCache]: Analyzing trace with hash 890883481, now seen corresponding path program 12 times [2020-09-04 21:37:43,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:43,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2025281231] [2020-09-04 21:37:43,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 21:37:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 21:37:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 21:37:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 366 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:43,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2025281231] [2020-09-04 21:37:43,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:43,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:37:43,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869785194] [2020-09-04 21:37:43,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:37:43,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:43,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:37:43,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:37:43,739 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand 16 states. [2020-09-04 21:37:44,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:44,043 INFO L93 Difference]: Finished difference Result 618 states and 746 transitions. [2020-09-04 21:37:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:37:44,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 163 [2020-09-04 21:37:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:44,047 INFO L225 Difference]: With dead ends: 618 [2020-09-04 21:37:44,047 INFO L226 Difference]: Without dead ends: 438 [2020-09-04 21:37:44,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:37:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-09-04 21:37:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2020-09-04 21:37:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-09-04 21:37:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 350 transitions. [2020-09-04 21:37:44,083 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 350 transitions. Word has length 163 [2020-09-04 21:37:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:44,084 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 350 transitions. [2020-09-04 21:37:44,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:37:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 350 transitions. [2020-09-04 21:37:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-04 21:37:44,086 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:44,086 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:44,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 21:37:44,087 INFO L427 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372725, now seen corresponding path program 11 times [2020-09-04 21:37:44,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:44,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [243848871] [2020-09-04 21:37:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 21:37:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 21:37:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 21:37:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 7 proven. 344 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:44,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [243848871] [2020-09-04 21:37:44,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:44,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:37:44,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259962408] [2020-09-04 21:37:44,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:37:44,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:44,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:37:44,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:37:44,538 INFO L87 Difference]: Start difference. First operand 286 states and 350 transitions. Second operand 16 states. [2020-09-04 21:37:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:45,112 INFO L93 Difference]: Finished difference Result 532 states and 660 transitions. [2020-09-04 21:37:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:37:45,113 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 163 [2020-09-04 21:37:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:45,116 INFO L225 Difference]: With dead ends: 532 [2020-09-04 21:37:45,116 INFO L226 Difference]: Without dead ends: 354 [2020-09-04 21:37:45,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:37:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-09-04 21:37:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 286. [2020-09-04 21:37:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-09-04 21:37:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 350 transitions. [2020-09-04 21:37:45,148 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 350 transitions. Word has length 163 [2020-09-04 21:37:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:45,148 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 350 transitions. [2020-09-04 21:37:45,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:37:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 350 transitions. [2020-09-04 21:37:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 21:37:45,151 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:45,151 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:45,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 21:37:45,152 INFO L427 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1892454033, now seen corresponding path program 13 times [2020-09-04 21:37:45,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:45,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1623439386] [2020-09-04 21:37:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 21:37:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 21:37:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 21:37:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 6 proven. 428 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:45,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1623439386] [2020-09-04 21:37:45,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:45,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:37:45,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614546238] [2020-09-04 21:37:45,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:37:45,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:45,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:37:45,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:37:45,513 INFO L87 Difference]: Start difference. First operand 286 states and 350 transitions. Second operand 17 states. [2020-09-04 21:37:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:45,849 INFO L93 Difference]: Finished difference Result 645 states and 779 transitions. [2020-09-04 21:37:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:37:45,849 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-09-04 21:37:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:45,853 INFO L225 Difference]: With dead ends: 645 [2020-09-04 21:37:45,853 INFO L226 Difference]: Without dead ends: 460 [2020-09-04 21:37:45,855 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:37:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-09-04 21:37:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 296. [2020-09-04 21:37:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 21:37:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2020-09-04 21:37:45,890 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 168 [2020-09-04 21:37:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:45,890 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2020-09-04 21:37:45,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:37:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2020-09-04 21:37:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 21:37:45,893 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:45,893 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:45,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-04 21:37:45,894 INFO L427 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1139802173, now seen corresponding path program 12 times [2020-09-04 21:37:45,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:45,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265992583] [2020-09-04 21:37:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 21:37:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 21:37:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 21:37:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 7 proven. 404 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:46,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265992583] [2020-09-04 21:37:46,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:46,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:37:46,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852313138] [2020-09-04 21:37:46,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:37:46,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:46,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:37:46,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:37:46,387 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 17 states. [2020-09-04 21:37:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:47,097 INFO L93 Difference]: Finished difference Result 551 states and 685 transitions. [2020-09-04 21:37:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:37:47,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-09-04 21:37:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:47,101 INFO L225 Difference]: With dead ends: 551 [2020-09-04 21:37:47,102 INFO L226 Difference]: Without dead ends: 368 [2020-09-04 21:37:47,103 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:37:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2020-09-04 21:37:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 296. [2020-09-04 21:37:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 21:37:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2020-09-04 21:37:47,156 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 168 [2020-09-04 21:37:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:47,156 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2020-09-04 21:37:47,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:37:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2020-09-04 21:37:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-04 21:37:47,159 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:47,159 INFO L422 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:47,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-04 21:37:47,159 INFO L427 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash -33314663, now seen corresponding path program 14 times [2020-09-04 21:37:47,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:47,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1645353690] [2020-09-04 21:37:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-09-04 21:37:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 21:37:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 21:37:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 6 proven. 495 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:47,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1645353690] [2020-09-04 21:37:47,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:47,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 21:37:47,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527684420] [2020-09-04 21:37:47,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 21:37:47,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:47,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 21:37:47,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:37:47,551 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 18 states. [2020-09-04 21:37:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:47,930 INFO L93 Difference]: Finished difference Result 672 states and 812 transitions. [2020-09-04 21:37:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:37:47,932 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2020-09-04 21:37:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:47,935 INFO L225 Difference]: With dead ends: 672 [2020-09-04 21:37:47,936 INFO L226 Difference]: Without dead ends: 482 [2020-09-04 21:37:47,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:37:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-09-04 21:37:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 306. [2020-09-04 21:37:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-09-04 21:37:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 376 transitions. [2020-09-04 21:37:47,974 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 376 transitions. Word has length 173 [2020-09-04 21:37:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:47,975 INFO L479 AbstractCegarLoop]: Abstraction has 306 states and 376 transitions. [2020-09-04 21:37:47,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 21:37:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 376 transitions. [2020-09-04 21:37:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-04 21:37:47,979 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:47,979 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:47,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-04 21:37:47,980 INFO L427 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:47,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:47,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1229396427, now seen corresponding path program 13 times [2020-09-04 21:37:47,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:47,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1461788395] [2020-09-04 21:37:47,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-09-04 21:37:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 21:37:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 21:37:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 7 proven. 469 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:48,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1461788395] [2020-09-04 21:37:48,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:48,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 21:37:48,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474632708] [2020-09-04 21:37:48,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 21:37:48,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:48,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 21:37:48,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:37:48,531 INFO L87 Difference]: Start difference. First operand 306 states and 376 transitions. Second operand 18 states. [2020-09-04 21:37:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:49,225 INFO L93 Difference]: Finished difference Result 570 states and 710 transitions. [2020-09-04 21:37:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:37:49,226 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2020-09-04 21:37:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:49,229 INFO L225 Difference]: With dead ends: 570 [2020-09-04 21:37:49,229 INFO L226 Difference]: Without dead ends: 382 [2020-09-04 21:37:49,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:37:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-09-04 21:37:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 306. [2020-09-04 21:37:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-09-04 21:37:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 376 transitions. [2020-09-04 21:37:49,261 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 376 transitions. Word has length 173 [2020-09-04 21:37:49,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:49,261 INFO L479 AbstractCegarLoop]: Abstraction has 306 states and 376 transitions. [2020-09-04 21:37:49,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 21:37:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 376 transitions. [2020-09-04 21:37:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-09-04 21:37:49,263 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:49,264 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:49,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-04 21:37:49,264 INFO L427 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2032954479, now seen corresponding path program 15 times [2020-09-04 21:37:49,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:49,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1373249604] [2020-09-04 21:37:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 21:37:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 21:37:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-09-04 21:37:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2020-09-04 21:37:49,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1373249604] [2020-09-04 21:37:49,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:37:49,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 21:37:49,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789788224] [2020-09-04 21:37:49,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 21:37:49,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 21:37:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 21:37:49,377 INFO L87 Difference]: Start difference. First operand 306 states and 376 transitions. Second operand 3 states. [2020-09-04 21:37:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:49,417 INFO L93 Difference]: Finished difference Result 321 states and 393 transitions. [2020-09-04 21:37:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 21:37:49,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-09-04 21:37:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:49,420 INFO L225 Difference]: With dead ends: 321 [2020-09-04 21:37:49,420 INFO L226 Difference]: Without dead ends: 305 [2020-09-04 21:37:49,421 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 21:37:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-09-04 21:37:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2020-09-04 21:37:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-09-04 21:37:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 374 transitions. [2020-09-04 21:37:49,451 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 374 transitions. Word has length 178 [2020-09-04 21:37:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:49,451 INFO L479 AbstractCegarLoop]: Abstraction has 305 states and 374 transitions. [2020-09-04 21:37:49,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 21:37:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2020-09-04 21:37:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 21:37:49,453 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:49,454 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:49,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-04 21:37:49,455 INFO L427 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash 368593816, now seen corresponding path program 1 times [2020-09-04 21:37:49,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:49,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [809524259] [2020-09-04 21:37:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 21:37:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 21:37:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 21:37:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2020-09-04 21:37:49,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [809524259] [2020-09-04 21:37:49,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:37:49,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 21:37:49,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183092221] [2020-09-04 21:37:49,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 21:37:49,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:49,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 21:37:49,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 21:37:49,563 INFO L87 Difference]: Start difference. First operand 305 states and 374 transitions. Second operand 4 states. [2020-09-04 21:37:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:49,607 INFO L93 Difference]: Finished difference Result 321 states and 392 transitions. [2020-09-04 21:37:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 21:37:49,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-09-04 21:37:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:49,615 INFO L225 Difference]: With dead ends: 321 [2020-09-04 21:37:49,615 INFO L226 Difference]: Without dead ends: 304 [2020-09-04 21:37:49,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-04 21:37:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-09-04 21:37:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-09-04 21:37:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 372 transitions. [2020-09-04 21:37:49,662 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 372 transitions. Word has length 180 [2020-09-04 21:37:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:49,662 INFO L479 AbstractCegarLoop]: Abstraction has 304 states and 372 transitions. [2020-09-04 21:37:49,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 21:37:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 372 transitions. [2020-09-04 21:37:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 21:37:49,677 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:49,678 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:49,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-04 21:37:49,678 INFO L427 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1683689272, now seen corresponding path program 1 times [2020-09-04 21:37:49,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:49,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1173376218] [2020-09-04 21:37:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 21:37:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 21:37:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 21:37:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 6 proven. 567 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:50,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1173376218] [2020-09-04 21:37:50,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:50,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:37:50,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531291207] [2020-09-04 21:37:50,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:37:50,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:37:50,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:37:50,175 INFO L87 Difference]: Start difference. First operand 304 states and 372 transitions. Second operand 19 states. [2020-09-04 21:37:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:50,558 INFO L93 Difference]: Finished difference Result 695 states and 837 transitions. [2020-09-04 21:37:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:37:50,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2020-09-04 21:37:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:50,565 INFO L225 Difference]: With dead ends: 695 [2020-09-04 21:37:50,565 INFO L226 Difference]: Without dead ends: 502 [2020-09-04 21:37:50,569 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:37:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-09-04 21:37:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 314. [2020-09-04 21:37:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-09-04 21:37:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2020-09-04 21:37:50,606 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 180 [2020-09-04 21:37:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:50,606 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2020-09-04 21:37:50,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:37:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2020-09-04 21:37:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 21:37:50,608 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:50,608 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:50,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-04 21:37:50,609 INFO L427 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash -326698006, now seen corresponding path program 1 times [2020-09-04 21:37:50,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:50,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [869304298] [2020-09-04 21:37:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 21:37:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 21:37:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 21:37:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 7 proven. 539 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:51,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [869304298] [2020-09-04 21:37:51,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:51,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:37:51,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749553390] [2020-09-04 21:37:51,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:37:51,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:51,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:37:51,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:37:51,153 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 19 states. [2020-09-04 21:37:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:51,957 INFO L93 Difference]: Finished difference Result 585 states and 727 transitions. [2020-09-04 21:37:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:37:51,958 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2020-09-04 21:37:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:51,960 INFO L225 Difference]: With dead ends: 585 [2020-09-04 21:37:51,961 INFO L226 Difference]: Without dead ends: 394 [2020-09-04 21:37:51,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:37:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-09-04 21:37:51,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 314. [2020-09-04 21:37:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-09-04 21:37:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2020-09-04 21:37:51,996 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 180 [2020-09-04 21:37:51,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:51,996 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2020-09-04 21:37:51,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:37:51,996 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2020-09-04 21:37:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-09-04 21:37:51,998 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:51,998 INFO L422 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:51,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-04 21:37:51,999 INFO L427 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:51,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:51,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1714201280, now seen corresponding path program 2 times [2020-09-04 21:37:51,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:51,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1662565264] [2020-09-04 21:37:52,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 21:37:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-09-04 21:37:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 21:37:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 6 proven. 644 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:52,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1662565264] [2020-09-04 21:37:52,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:52,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:37:52,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060430517] [2020-09-04 21:37:52,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:37:52,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:37:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:37:52,450 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 20 states. [2020-09-04 21:37:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:52,890 INFO L93 Difference]: Finished difference Result 722 states and 870 transitions. [2020-09-04 21:37:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:37:52,891 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 185 [2020-09-04 21:37:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:52,894 INFO L225 Difference]: With dead ends: 722 [2020-09-04 21:37:52,895 INFO L226 Difference]: Without dead ends: 524 [2020-09-04 21:37:52,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:37:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-09-04 21:37:52,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 324. [2020-09-04 21:37:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-09-04 21:37:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 398 transitions. [2020-09-04 21:37:52,932 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 398 transitions. Word has length 185 [2020-09-04 21:37:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:52,933 INFO L479 AbstractCegarLoop]: Abstraction has 324 states and 398 transitions. [2020-09-04 21:37:52,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:37:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 398 transitions. [2020-09-04 21:37:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-09-04 21:37:52,934 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:52,935 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:52,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-04 21:37:52,935 INFO L427 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:52,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash 570378738, now seen corresponding path program 2 times [2020-09-04 21:37:52,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:52,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [398717195] [2020-09-04 21:37:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 21:37:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-09-04 21:37:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 21:37:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 7 proven. 614 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:53,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [398717195] [2020-09-04 21:37:53,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:53,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:37:53,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424642915] [2020-09-04 21:37:53,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:37:53,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:37:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:37:53,529 INFO L87 Difference]: Start difference. First operand 324 states and 398 transitions. Second operand 20 states. [2020-09-04 21:37:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:54,575 INFO L93 Difference]: Finished difference Result 604 states and 752 transitions. [2020-09-04 21:37:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:37:54,576 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 185 [2020-09-04 21:37:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:54,579 INFO L225 Difference]: With dead ends: 604 [2020-09-04 21:37:54,579 INFO L226 Difference]: Without dead ends: 408 [2020-09-04 21:37:54,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:37:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2020-09-04 21:37:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 324. [2020-09-04 21:37:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-09-04 21:37:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 398 transitions. [2020-09-04 21:37:54,616 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 398 transitions. Word has length 185 [2020-09-04 21:37:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:54,616 INFO L479 AbstractCegarLoop]: Abstraction has 324 states and 398 transitions. [2020-09-04 21:37:54,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:37:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 398 transitions. [2020-09-04 21:37:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-09-04 21:37:54,618 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:54,618 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:54,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-09-04 21:37:54,619 INFO L427 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash 922915896, now seen corresponding path program 3 times [2020-09-04 21:37:54,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:54,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2001642049] [2020-09-04 21:37:54,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-09-04 21:37:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 21:37:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 21:37:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 6 proven. 726 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:55,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2001642049] [2020-09-04 21:37:55,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:55,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 21:37:55,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809181176] [2020-09-04 21:37:55,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 21:37:55,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:55,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 21:37:55,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:37:55,173 INFO L87 Difference]: Start difference. First operand 324 states and 398 transitions. Second operand 21 states. [2020-09-04 21:37:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:55,710 INFO L93 Difference]: Finished difference Result 749 states and 903 transitions. [2020-09-04 21:37:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:37:55,711 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 190 [2020-09-04 21:37:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:55,715 INFO L225 Difference]: With dead ends: 749 [2020-09-04 21:37:55,715 INFO L226 Difference]: Without dead ends: 546 [2020-09-04 21:37:55,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:37:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-09-04 21:37:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 334. [2020-09-04 21:37:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-09-04 21:37:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 411 transitions. [2020-09-04 21:37:55,755 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 411 transitions. Word has length 190 [2020-09-04 21:37:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:55,756 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 411 transitions. [2020-09-04 21:37:55,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 21:37:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 411 transitions. [2020-09-04 21:37:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-09-04 21:37:55,758 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:55,758 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:55,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-04 21:37:55,758 INFO L427 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:55,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1087471382, now seen corresponding path program 3 times [2020-09-04 21:37:55,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:55,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [914298576] [2020-09-04 21:37:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:56,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-09-04 21:37:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:56,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 21:37:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:56,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 21:37:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 7 proven. 694 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:56,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [914298576] [2020-09-04 21:37:56,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:56,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 21:37:56,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631772432] [2020-09-04 21:37:56,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 21:37:56,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 21:37:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:37:56,567 INFO L87 Difference]: Start difference. First operand 334 states and 411 transitions. Second operand 21 states. [2020-09-04 21:37:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:57,549 INFO L93 Difference]: Finished difference Result 623 states and 777 transitions. [2020-09-04 21:37:57,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:37:57,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 190 [2020-09-04 21:37:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:57,552 INFO L225 Difference]: With dead ends: 623 [2020-09-04 21:37:57,552 INFO L226 Difference]: Without dead ends: 422 [2020-09-04 21:37:57,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:37:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-09-04 21:37:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 334. [2020-09-04 21:37:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-09-04 21:37:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 411 transitions. [2020-09-04 21:37:57,592 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 411 transitions. Word has length 190 [2020-09-04 21:37:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:57,592 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 411 transitions. [2020-09-04 21:37:57,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 21:37:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 411 transitions. [2020-09-04 21:37:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 21:37:57,594 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:57,594 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:57,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-04 21:37:57,595 INFO L427 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:57,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:57,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1276573760, now seen corresponding path program 4 times [2020-09-04 21:37:57,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:57,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1489132426] [2020-09-04 21:37:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 21:37:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 21:37:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 21:37:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 6 proven. 813 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:58,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1489132426] [2020-09-04 21:37:58,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:58,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 21:37:58,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190250625] [2020-09-04 21:37:58,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 21:37:58,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 21:37:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:37:58,127 INFO L87 Difference]: Start difference. First operand 334 states and 411 transitions. Second operand 22 states. [2020-09-04 21:37:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:58,577 INFO L93 Difference]: Finished difference Result 776 states and 936 transitions. [2020-09-04 21:37:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 21:37:58,578 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 195 [2020-09-04 21:37:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:58,581 INFO L225 Difference]: With dead ends: 776 [2020-09-04 21:37:58,581 INFO L226 Difference]: Without dead ends: 568 [2020-09-04 21:37:58,582 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:37:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-09-04 21:37:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 344. [2020-09-04 21:37:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-09-04 21:37:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 424 transitions. [2020-09-04 21:37:58,622 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 424 transitions. Word has length 195 [2020-09-04 21:37:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:58,622 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 424 transitions. [2020-09-04 21:37:58,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 21:37:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 424 transitions. [2020-09-04 21:37:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 21:37:58,624 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:58,625 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:37:58,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-09-04 21:37:58,625 INFO L427 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:58,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash -733813518, now seen corresponding path program 4 times [2020-09-04 21:37:58,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:58,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [56327147] [2020-09-04 21:37:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:59,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 21:37:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:59,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 21:37:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:59,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 21:37:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 7 proven. 779 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:59,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [56327147] [2020-09-04 21:37:59,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:59,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 21:37:59,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323493254] [2020-09-04 21:37:59,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 21:37:59,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 21:37:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:37:59,275 INFO L87 Difference]: Start difference. First operand 344 states and 424 transitions. Second operand 22 states. [2020-09-04 21:38:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:00,404 INFO L93 Difference]: Finished difference Result 642 states and 802 transitions. [2020-09-04 21:38:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 21:38:00,405 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 195 [2020-09-04 21:38:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:00,407 INFO L225 Difference]: With dead ends: 642 [2020-09-04 21:38:00,407 INFO L226 Difference]: Without dead ends: 436 [2020-09-04 21:38:00,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:38:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-09-04 21:38:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 344. [2020-09-04 21:38:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-09-04 21:38:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 424 transitions. [2020-09-04 21:38:00,447 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 424 transitions. Word has length 195 [2020-09-04 21:38:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:00,448 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 424 transitions. [2020-09-04 21:38:00,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 21:38:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 424 transitions. [2020-09-04 21:38:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 21:38:00,450 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:00,450 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:00,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-09-04 21:38:00,450 INFO L427 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash -171452104, now seen corresponding path program 5 times [2020-09-04 21:38:00,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:00,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807343778] [2020-09-04 21:38:00,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:00,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:00,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:00,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:00,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 21:38:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:00,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2020-09-04 21:38:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:00,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 21:38:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 6 proven. 905 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:01,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807343778] [2020-09-04 21:38:01,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:01,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:38:01,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192165734] [2020-09-04 21:38:01,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:38:01,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:01,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:38:01,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:38:01,030 INFO L87 Difference]: Start difference. First operand 344 states and 424 transitions. Second operand 23 states. [2020-09-04 21:38:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:01,595 INFO L93 Difference]: Finished difference Result 803 states and 969 transitions. [2020-09-04 21:38:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:38:01,600 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2020-09-04 21:38:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:01,604 INFO L225 Difference]: With dead ends: 803 [2020-09-04 21:38:01,604 INFO L226 Difference]: Without dead ends: 590 [2020-09-04 21:38:01,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:38:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-09-04 21:38:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 354. [2020-09-04 21:38:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-09-04 21:38:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2020-09-04 21:38:01,647 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 200 [2020-09-04 21:38:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:01,647 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2020-09-04 21:38:01,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:38:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2020-09-04 21:38:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 21:38:01,649 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:01,650 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:01,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-09-04 21:38:01,650 INFO L427 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:01,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:01,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2113127914, now seen corresponding path program 5 times [2020-09-04 21:38:01,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:01,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [222605091] [2020-09-04 21:38:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:02,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 21:38:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:02,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2020-09-04 21:38:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:02,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 21:38:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 7 proven. 869 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:38:02,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [222605091] [2020-09-04 21:38:02,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:02,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:38:02,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637169627] [2020-09-04 21:38:02,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:38:02,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:38:02,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:38:02,363 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand 23 states. [2020-09-04 21:38:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:03,624 INFO L93 Difference]: Finished difference Result 661 states and 827 transitions. [2020-09-04 21:38:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:38:03,625 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2020-09-04 21:38:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:03,627 INFO L225 Difference]: With dead ends: 661 [2020-09-04 21:38:03,627 INFO L226 Difference]: Without dead ends: 450 [2020-09-04 21:38:03,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:38:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-09-04 21:38:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 354. [2020-09-04 21:38:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-09-04 21:38:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2020-09-04 21:38:03,673 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 200 [2020-09-04 21:38:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:03,673 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2020-09-04 21:38:03,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:38:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2020-09-04 21:38:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-04 21:38:03,675 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:03,675 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:03,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-09-04 21:38:03,675 INFO L427 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:03,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1093348544, now seen corresponding path program 6 times [2020-09-04 21:38:03,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:03,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [748823286] [2020-09-04 21:38:03,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 21:38:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 21:38:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 21:38:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 6 proven. 1002 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:04,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [748823286] [2020-09-04 21:38:04,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:04,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-04 21:38:04,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279495991] [2020-09-04 21:38:04,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 21:38:04,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:04,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 21:38:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:38:04,250 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand 24 states. [2020-09-04 21:38:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:04,773 INFO L93 Difference]: Finished difference Result 830 states and 1002 transitions. [2020-09-04 21:38:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 21:38:04,774 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 205 [2020-09-04 21:38:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:04,777 INFO L225 Difference]: With dead ends: 830 [2020-09-04 21:38:04,778 INFO L226 Difference]: Without dead ends: 612 [2020-09-04 21:38:04,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:38:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-09-04 21:38:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 364. [2020-09-04 21:38:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-09-04 21:38:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 450 transitions. [2020-09-04 21:38:04,836 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 450 transitions. Word has length 205 [2020-09-04 21:38:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:04,838 INFO L479 AbstractCegarLoop]: Abstraction has 364 states and 450 transitions. [2020-09-04 21:38:04,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 21:38:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 450 transitions. [2020-09-04 21:38:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-04 21:38:04,843 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:04,843 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:04,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-09-04 21:38:04,844 INFO L427 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1191231474, now seen corresponding path program 6 times [2020-09-04 21:38:04,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:04,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [370687743] [2020-09-04 21:38:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 21:38:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 21:38:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 21:38:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 7 proven. 964 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:38:05,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [370687743] [2020-09-04 21:38:05,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:05,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-04 21:38:05,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123710002] [2020-09-04 21:38:05,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 21:38:05,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 21:38:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:38:05,626 INFO L87 Difference]: Start difference. First operand 364 states and 450 transitions. Second operand 24 states. [2020-09-04 21:38:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:06,896 INFO L93 Difference]: Finished difference Result 680 states and 852 transitions. [2020-09-04 21:38:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 21:38:06,898 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 205 [2020-09-04 21:38:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:06,902 INFO L225 Difference]: With dead ends: 680 [2020-09-04 21:38:06,902 INFO L226 Difference]: Without dead ends: 464 [2020-09-04 21:38:06,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:38:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-09-04 21:38:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 364. [2020-09-04 21:38:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-09-04 21:38:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 450 transitions. [2020-09-04 21:38:06,951 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 450 transitions. Word has length 205 [2020-09-04 21:38:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:06,952 INFO L479 AbstractCegarLoop]: Abstraction has 364 states and 450 transitions. [2020-09-04 21:38:06,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 21:38:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 450 transitions. [2020-09-04 21:38:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 21:38:06,954 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:06,954 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:06,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-09-04 21:38:06,954 INFO L427 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:06,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1719328312, now seen corresponding path program 7 times [2020-09-04 21:38:06,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:06,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031660429] [2020-09-04 21:38:06,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-09-04 21:38:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-09-04 21:38:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-09-04 21:38:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 6 proven. 1104 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:07,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031660429] [2020-09-04 21:38:07,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:07,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 21:38:07,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924685278] [2020-09-04 21:38:07,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 21:38:07,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 21:38:07,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:38:07,762 INFO L87 Difference]: Start difference. First operand 364 states and 450 transitions. Second operand 25 states. [2020-09-04 21:38:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:08,313 INFO L93 Difference]: Finished difference Result 857 states and 1035 transitions. [2020-09-04 21:38:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 21:38:08,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 210 [2020-09-04 21:38:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:08,318 INFO L225 Difference]: With dead ends: 857 [2020-09-04 21:38:08,318 INFO L226 Difference]: Without dead ends: 634 [2020-09-04 21:38:08,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:38:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-09-04 21:38:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 374. [2020-09-04 21:38:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-09-04 21:38:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 463 transitions. [2020-09-04 21:38:08,368 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 463 transitions. Word has length 210 [2020-09-04 21:38:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:08,369 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 463 transitions. [2020-09-04 21:38:08,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 21:38:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 463 transitions. [2020-09-04 21:38:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 21:38:08,371 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:08,371 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:08,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-09-04 21:38:08,371 INFO L427 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash -291058966, now seen corresponding path program 7 times [2020-09-04 21:38:08,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:08,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801237574] [2020-09-04 21:38:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:09,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-09-04 21:38:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:09,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-09-04 21:38:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:09,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-09-04 21:38:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 7 proven. 1064 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:38:09,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801237574] [2020-09-04 21:38:09,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:09,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 21:38:09,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629876109] [2020-09-04 21:38:09,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 21:38:09,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:09,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 21:38:09,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:38:09,208 INFO L87 Difference]: Start difference. First operand 374 states and 463 transitions. Second operand 25 states. [2020-09-04 21:38:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:10,590 INFO L93 Difference]: Finished difference Result 699 states and 877 transitions. [2020-09-04 21:38:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 21:38:10,591 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 210 [2020-09-04 21:38:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:10,593 INFO L225 Difference]: With dead ends: 699 [2020-09-04 21:38:10,593 INFO L226 Difference]: Without dead ends: 478 [2020-09-04 21:38:10,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:38:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-09-04 21:38:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 374. [2020-09-04 21:38:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-09-04 21:38:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 463 transitions. [2020-09-04 21:38:10,636 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 463 transitions. Word has length 210 [2020-09-04 21:38:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:10,637 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 463 transitions. [2020-09-04 21:38:10,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 21:38:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 463 transitions. [2020-09-04 21:38:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-04 21:38:10,639 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:10,639 INFO L422 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:10,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-09-04 21:38:10,639 INFO L427 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:10,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:10,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1312616000, now seen corresponding path program 8 times [2020-09-04 21:38:10,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:10,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [761148597] [2020-09-04 21:38:10,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:10,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:10,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:10,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 21:38:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 21:38:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2020-09-04 21:38:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 6 proven. 1211 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:11,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [761148597] [2020-09-04 21:38:11,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:11,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-04 21:38:11,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228257992] [2020-09-04 21:38:11,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 21:38:11,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:11,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 21:38:11,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:38:11,282 INFO L87 Difference]: Start difference. First operand 374 states and 463 transitions. Second operand 26 states. [2020-09-04 21:38:11,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:11,868 INFO L93 Difference]: Finished difference Result 884 states and 1068 transitions. [2020-09-04 21:38:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:38:11,869 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2020-09-04 21:38:11,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:11,873 INFO L225 Difference]: With dead ends: 884 [2020-09-04 21:38:11,873 INFO L226 Difference]: Without dead ends: 656 [2020-09-04 21:38:11,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:38:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-09-04 21:38:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 384. [2020-09-04 21:38:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-09-04 21:38:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2020-09-04 21:38:11,925 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 215 [2020-09-04 21:38:11,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:11,925 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2020-09-04 21:38:11,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 21:38:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2020-09-04 21:38:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-04 21:38:11,927 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:11,927 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:11,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-09-04 21:38:11,927 INFO L427 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:11,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash -697771278, now seen corresponding path program 8 times [2020-09-04 21:38:11,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:11,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344403407] [2020-09-04 21:38:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:12,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 21:38:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:12,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 21:38:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:12,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2020-09-04 21:38:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 7 proven. 1169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:38:12,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [344403407] [2020-09-04 21:38:12,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:12,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-04 21:38:12,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733616164] [2020-09-04 21:38:12,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 21:38:12,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 21:38:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:38:12,830 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand 26 states. [2020-09-04 21:38:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:14,557 INFO L93 Difference]: Finished difference Result 718 states and 902 transitions. [2020-09-04 21:38:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:38:14,558 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2020-09-04 21:38:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:14,560 INFO L225 Difference]: With dead ends: 718 [2020-09-04 21:38:14,560 INFO L226 Difference]: Without dead ends: 492 [2020-09-04 21:38:14,561 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:38:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-09-04 21:38:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 384. [2020-09-04 21:38:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-09-04 21:38:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2020-09-04 21:38:14,605 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 215 [2020-09-04 21:38:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:14,606 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2020-09-04 21:38:14,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 21:38:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2020-09-04 21:38:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-04 21:38:14,608 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:14,608 INFO L422 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:14,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-09-04 21:38:14,608 INFO L427 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1256956728, now seen corresponding path program 9 times [2020-09-04 21:38:14,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:14,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [963527540] [2020-09-04 21:38:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:14,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:14,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:14,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-09-04 21:38:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 21:38:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-09-04 21:38:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 6 proven. 1323 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:15,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [963527540] [2020-09-04 21:38:15,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:15,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-04 21:38:15,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46412941] [2020-09-04 21:38:15,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 21:38:15,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 21:38:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:38:15,445 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand 27 states. [2020-09-04 21:38:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:16,132 INFO L93 Difference]: Finished difference Result 911 states and 1101 transitions. [2020-09-04 21:38:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 21:38:16,133 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2020-09-04 21:38:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:16,137 INFO L225 Difference]: With dead ends: 911 [2020-09-04 21:38:16,137 INFO L226 Difference]: Without dead ends: 678 [2020-09-04 21:38:16,138 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:38:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-09-04 21:38:16,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 394. [2020-09-04 21:38:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-09-04 21:38:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2020-09-04 21:38:16,181 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 220 [2020-09-04 21:38:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:16,181 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2020-09-04 21:38:16,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 21:38:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2020-09-04 21:38:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-04 21:38:16,182 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:16,183 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:16,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-09-04 21:38:16,183 INFO L427 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash -753430550, now seen corresponding path program 9 times [2020-09-04 21:38:16,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:16,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [553278487] [2020-09-04 21:38:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-09-04 21:38:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 21:38:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-09-04 21:38:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 7 proven. 1279 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:38:17,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [553278487] [2020-09-04 21:38:17,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:17,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-04 21:38:17,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899240032] [2020-09-04 21:38:17,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 21:38:17,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:17,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 21:38:17,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:38:17,158 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 27 states. [2020-09-04 21:38:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:19,022 INFO L93 Difference]: Finished difference Result 737 states and 927 transitions. [2020-09-04 21:38:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 21:38:19,023 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2020-09-04 21:38:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:19,024 INFO L225 Difference]: With dead ends: 737 [2020-09-04 21:38:19,024 INFO L226 Difference]: Without dead ends: 506 [2020-09-04 21:38:19,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:38:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-09-04 21:38:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 394. [2020-09-04 21:38:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-09-04 21:38:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2020-09-04 21:38:19,073 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 220 [2020-09-04 21:38:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:19,073 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2020-09-04 21:38:19,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 21:38:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2020-09-04 21:38:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 21:38:19,074 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:19,074 INFO L422 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:19,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-09-04 21:38:19,075 INFO L427 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:19,075 INFO L82 PathProgramCache]: Analyzing trace with hash -629192384, now seen corresponding path program 10 times [2020-09-04 21:38:19,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:19,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1276809937] [2020-09-04 21:38:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 6 proven. 1440 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:19,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1276809937] [2020-09-04 21:38:19,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:19,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-09-04 21:38:19,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882282060] [2020-09-04 21:38:19,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 21:38:19,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:19,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 21:38:19,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:38:19,988 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 28 states. [2020-09-04 21:38:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:20,918 INFO L93 Difference]: Finished difference Result 938 states and 1134 transitions. [2020-09-04 21:38:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 21:38:20,919 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-09-04 21:38:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:20,923 INFO L225 Difference]: With dead ends: 938 [2020-09-04 21:38:20,923 INFO L226 Difference]: Without dead ends: 700 [2020-09-04 21:38:20,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=405, Invalid=407, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:38:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-09-04 21:38:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 404. [2020-09-04 21:38:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-09-04 21:38:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 502 transitions. [2020-09-04 21:38:20,981 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 502 transitions. Word has length 225 [2020-09-04 21:38:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:20,981 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 502 transitions. [2020-09-04 21:38:20,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 21:38:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 502 transitions. [2020-09-04 21:38:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 21:38:20,983 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:20,984 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:20,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-09-04 21:38:20,984 INFO L427 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1655387634, now seen corresponding path program 10 times [2020-09-04 21:38:20,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:20,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396226390] [2020-09-04 21:38:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-09-04 21:38:21,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396226390] [2020-09-04 21:38:21,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:21,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:38:21,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041627939] [2020-09-04 21:38:21,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:38:21,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:21,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:38:21,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:21,313 INFO L87 Difference]: Start difference. First operand 404 states and 502 transitions. Second operand 10 states. [2020-09-04 21:38:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:21,667 INFO L93 Difference]: Finished difference Result 459 states and 581 transitions. [2020-09-04 21:38:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:38:21,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 225 [2020-09-04 21:38:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:21,671 INFO L225 Difference]: With dead ends: 459 [2020-09-04 21:38:21,672 INFO L226 Difference]: Without dead ends: 453 [2020-09-04 21:38:21,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:38:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2020-09-04 21:38:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 430. [2020-09-04 21:38:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-09-04 21:38:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 540 transitions. [2020-09-04 21:38:21,748 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 540 transitions. Word has length 225 [2020-09-04 21:38:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:21,749 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 540 transitions. [2020-09-04 21:38:21,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:38:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 540 transitions. [2020-09-04 21:38:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-04 21:38:21,751 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:21,751 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:21,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-09-04 21:38:21,752 INFO L427 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash -131719239, now seen corresponding path program 1 times [2020-09-04 21:38:21,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:21,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [808015607] [2020-09-04 21:38:21,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-09-04 21:38:22,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [808015607] [2020-09-04 21:38:22,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:22,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:38:22,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118662580] [2020-09-04 21:38:22,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:38:22,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:38:22,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:38:22,141 INFO L87 Difference]: Start difference. First operand 430 states and 540 transitions. Second operand 12 states. [2020-09-04 21:38:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:22,499 INFO L93 Difference]: Finished difference Result 459 states and 579 transitions. [2020-09-04 21:38:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:38:22,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 227 [2020-09-04 21:38:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:22,503 INFO L225 Difference]: With dead ends: 459 [2020-09-04 21:38:22,504 INFO L226 Difference]: Without dead ends: 452 [2020-09-04 21:38:22,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:38:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-09-04 21:38:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2020-09-04 21:38:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-09-04 21:38:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 549 transitions. [2020-09-04 21:38:22,578 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 549 transitions. Word has length 227 [2020-09-04 21:38:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:22,578 INFO L479 AbstractCegarLoop]: Abstraction has 438 states and 549 transitions. [2020-09-04 21:38:22,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:38:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 549 transitions. [2020-09-04 21:38:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-04 21:38:22,581 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:22,581 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:22,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-09-04 21:38:22,582 INFO L427 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:22,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:22,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1678288039, now seen corresponding path program 1 times [2020-09-04 21:38:22,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:22,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [473979553] [2020-09-04 21:38:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2020-09-04 21:38:22,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [473979553] [2020-09-04 21:38:22,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:22,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 21:38:22,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830920637] [2020-09-04 21:38:22,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:38:22,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:22,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:38:22,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:38:22,798 INFO L87 Difference]: Start difference. First operand 438 states and 549 transitions. Second operand 6 states. [2020-09-04 21:38:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:22,892 INFO L93 Difference]: Finished difference Result 444 states and 554 transitions. [2020-09-04 21:38:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:38:22,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2020-09-04 21:38:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:22,896 INFO L225 Difference]: With dead ends: 444 [2020-09-04 21:38:22,896 INFO L226 Difference]: Without dead ends: 432 [2020-09-04 21:38:22,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-09-04 21:38:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-09-04 21:38:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-09-04 21:38:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-09-04 21:38:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 541 transitions. [2020-09-04 21:38:22,972 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 541 transitions. Word has length 227 [2020-09-04 21:38:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:22,972 INFO L479 AbstractCegarLoop]: Abstraction has 432 states and 541 transitions. [2020-09-04 21:38:22,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:38:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 541 transitions. [2020-09-04 21:38:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-09-04 21:38:22,975 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:22,975 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2020-09-04 21:38:22,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-09-04 21:38:22,975 INFO L427 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash 947853182, now seen corresponding path program 1 times [2020-09-04 21:38:22,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:22,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1620171102] [2020-09-04 21:38:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:38:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-09-04 21:38:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 21:38:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 21:38:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2020-09-04 21:38:23,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1620171102] [2020-09-04 21:38:23,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:23,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 21:38:23,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214836141] [2020-09-04 21:38:23,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:38:23,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:23,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:38:23,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:38:23,211 INFO L87 Difference]: Start difference. First operand 432 states and 541 transitions. Second operand 5 states. [2020-09-04 21:38:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:23,378 INFO L93 Difference]: Finished difference Result 691 states and 868 transitions. [2020-09-04 21:38:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:38:23,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2020-09-04 21:38:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:23,382 INFO L225 Difference]: With dead ends: 691 [2020-09-04 21:38:23,383 INFO L226 Difference]: Without dead ends: 280 [2020-09-04 21:38:23,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:38:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-09-04 21:38:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2020-09-04 21:38:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-09-04 21:38:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 327 transitions. [2020-09-04 21:38:23,426 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 327 transitions. Word has length 230 [2020-09-04 21:38:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:23,426 INFO L479 AbstractCegarLoop]: Abstraction has 263 states and 327 transitions. [2020-09-04 21:38:23,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:38:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 327 transitions. [2020-09-04 21:38:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-09-04 21:38:23,428 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:23,428 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:23,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-09-04 21:38:23,428 INFO L427 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash -671277925, now seen corresponding path program 1 times [2020-09-04 21:38:23,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:23,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1132770167] [2020-09-04 21:38:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-09-04 21:38:23,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1132770167] [2020-09-04 21:38:23,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:23,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 21:38:23,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677529937] [2020-09-04 21:38:23,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:38:23,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:38:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:38:23,710 INFO L87 Difference]: Start difference. First operand 263 states and 327 transitions. Second operand 8 states. [2020-09-04 21:38:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:23,908 INFO L93 Difference]: Finished difference Result 317 states and 389 transitions. [2020-09-04 21:38:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:38:23,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2020-09-04 21:38:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:23,911 INFO L225 Difference]: With dead ends: 317 [2020-09-04 21:38:23,912 INFO L226 Difference]: Without dead ends: 298 [2020-09-04 21:38:23,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:38:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-09-04 21:38:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 269. [2020-09-04 21:38:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-09-04 21:38:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2020-09-04 21:38:23,974 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 236 [2020-09-04 21:38:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:23,974 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2020-09-04 21:38:23,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:38:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2020-09-04 21:38:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-09-04 21:38:23,976 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:23,977 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:23,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-09-04 21:38:23,977 INFO L427 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:23,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:23,978 INFO L82 PathProgramCache]: Analyzing trace with hash 287100319, now seen corresponding path program 1 times [2020-09-04 21:38:23,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:23,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [348560694] [2020-09-04 21:38:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-09-04 21:38:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1415 trivial. 0 not checked. [2020-09-04 21:38:24,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [348560694] [2020-09-04 21:38:24,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:24,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:38:24,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272808527] [2020-09-04 21:38:24,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:38:24,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:24,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:38:24,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:38:24,329 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 11 states. [2020-09-04 21:38:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:24,604 INFO L93 Difference]: Finished difference Result 334 states and 403 transitions. [2020-09-04 21:38:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:38:24,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 240 [2020-09-04 21:38:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:24,606 INFO L225 Difference]: With dead ends: 334 [2020-09-04 21:38:24,606 INFO L226 Difference]: Without dead ends: 272 [2020-09-04 21:38:24,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:38:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-09-04 21:38:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2020-09-04 21:38:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-09-04 21:38:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2020-09-04 21:38:24,661 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 240 [2020-09-04 21:38:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:24,661 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2020-09-04 21:38:24,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:38:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2020-09-04 21:38:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-09-04 21:38:24,663 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:24,663 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:24,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-09-04 21:38:24,663 INFO L427 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:24,664 INFO L82 PathProgramCache]: Analyzing trace with hash -333217243, now seen corresponding path program 1 times [2020-09-04 21:38:24,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:24,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353407778] [2020-09-04 21:38:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 21:38:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2020-09-04 21:38:24,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353407778] [2020-09-04 21:38:24,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:24,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:38:24,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293010509] [2020-09-04 21:38:24,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:38:24,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:38:24,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:38:24,941 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 9 states. [2020-09-04 21:38:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:25,176 INFO L93 Difference]: Finished difference Result 331 states and 402 transitions. [2020-09-04 21:38:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:38:25,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 241 [2020-09-04 21:38:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:25,179 INFO L225 Difference]: With dead ends: 331 [2020-09-04 21:38:25,179 INFO L226 Difference]: Without dead ends: 319 [2020-09-04 21:38:25,180 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:38:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-09-04 21:38:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 311. [2020-09-04 21:38:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-09-04 21:38:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 382 transitions. [2020-09-04 21:38:25,262 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 382 transitions. Word has length 241 [2020-09-04 21:38:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:25,263 INFO L479 AbstractCegarLoop]: Abstraction has 311 states and 382 transitions. [2020-09-04 21:38:25,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:38:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 382 transitions. [2020-09-04 21:38:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-09-04 21:38:25,265 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:25,265 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:25,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-09-04 21:38:25,265 INFO L427 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1780452488, now seen corresponding path program 1 times [2020-09-04 21:38:25,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:25,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1627360425] [2020-09-04 21:38:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 21:38:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2020-09-04 21:38:25,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1627360425] [2020-09-04 21:38:25,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:25,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:38:25,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048493624] [2020-09-04 21:38:25,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:38:25,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:38:25,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:25,564 INFO L87 Difference]: Start difference. First operand 311 states and 382 transitions. Second operand 10 states. [2020-09-04 21:38:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:25,887 INFO L93 Difference]: Finished difference Result 323 states and 393 transitions. [2020-09-04 21:38:25,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:38:25,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2020-09-04 21:38:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:25,890 INFO L225 Difference]: With dead ends: 323 [2020-09-04 21:38:25,890 INFO L226 Difference]: Without dead ends: 297 [2020-09-04 21:38:25,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:38:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-09-04 21:38:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 268. [2020-09-04 21:38:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-09-04 21:38:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 305 transitions. [2020-09-04 21:38:25,947 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 305 transitions. Word has length 244 [2020-09-04 21:38:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:25,947 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 305 transitions. [2020-09-04 21:38:25,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:38:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 305 transitions. [2020-09-04 21:38:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-09-04 21:38:25,949 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:25,950 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:25,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-09-04 21:38:25,950 INFO L427 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1623599199, now seen corresponding path program 1 times [2020-09-04 21:38:25,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:25,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1664567997] [2020-09-04 21:38:25,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-09-04 21:38:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-09-04 21:38:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,702 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 32 [2020-09-04 21:38:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-09-04 21:38:28,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1664567997] [2020-09-04 21:38:28,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:28,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:38:28,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399945770] [2020-09-04 21:38:28,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:38:28,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:38:28,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:38:28,780 INFO L87 Difference]: Start difference. First operand 268 states and 305 transitions. Second operand 16 states. [2020-09-04 21:38:35,876 WARN L193 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-09-04 21:38:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:52,967 INFO L93 Difference]: Finished difference Result 327 states and 371 transitions. [2020-09-04 21:38:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:38:52,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 245 [2020-09-04 21:38:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:52,970 INFO L225 Difference]: With dead ends: 327 [2020-09-04 21:38:52,970 INFO L226 Difference]: Without dead ends: 315 [2020-09-04 21:38:52,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:38:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-09-04 21:38:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 307. [2020-09-04 21:38:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2020-09-04 21:38:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 351 transitions. [2020-09-04 21:38:53,016 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 351 transitions. Word has length 245 [2020-09-04 21:38:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:53,017 INFO L479 AbstractCegarLoop]: Abstraction has 307 states and 351 transitions. [2020-09-04 21:38:53,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:38:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 351 transitions. [2020-09-04 21:38:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-09-04 21:38:53,019 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:53,019 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 21:38:53,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-09-04 21:38:53,019 INFO L427 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:53,020 INFO L82 PathProgramCache]: Analyzing trace with hash 818281555, now seen corresponding path program 2 times [2020-09-04 21:38:53,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:53,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [681271943] [2020-09-04 21:38:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:53,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:53,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:53,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:53,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:53,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 21:38:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:53,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2020-09-04 21:38:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2020-09-04 21:38:53,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [681271943] [2020-09-04 21:38:53,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:53,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:38:53,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433699256] [2020-09-04 21:38:53,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:38:53,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:53,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:38:53,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:38:53,407 INFO L87 Difference]: Start difference. First operand 307 states and 351 transitions. Second operand 9 states. [2020-09-04 21:38:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:53,647 INFO L93 Difference]: Finished difference Result 307 states and 351 transitions. [2020-09-04 21:38:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:38:53,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 246 [2020-09-04 21:38:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:53,649 INFO L225 Difference]: With dead ends: 307 [2020-09-04 21:38:53,649 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:38:53,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:38:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:38:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:38:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:38:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:38:53,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2020-09-04 21:38:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:53,654 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:38:53,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:38:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:38:53,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:38:53,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-09-04 21:38:53,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:39:01,771 WARN L193 SmtUtils]: Spent 7.88 s on a formula simplification. DAG size of input: 492 DAG size of output: 4 [2020-09-04 21:39:12,551 WARN L193 SmtUtils]: Spent 10.77 s on a formula simplification. DAG size of input: 561 DAG size of output: 4 [2020-09-04 21:39:14,317 WARN L193 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 282 DAG size of output: 4 [2020-09-04 21:39:15,428 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 231 DAG size of output: 4 [2020-09-04 21:39:16,992 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 586 DAG size of output: 137 [2020-09-04 21:39:17,290 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 4 [2020-09-04 21:39:22,266 WARN L193 SmtUtils]: Spent 4.96 s on a formula simplification. DAG size of input: 427 DAG size of output: 4 [2020-09-04 21:39:25,140 WARN L193 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 337 DAG size of output: 4 [2020-09-04 21:39:33,984 WARN L193 SmtUtils]: Spent 8.84 s on a formula simplification. DAG size of input: 526 DAG size of output: 4 [2020-09-04 21:39:34,635 WARN L193 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 4 [2020-09-04 21:39:46,624 WARN L193 SmtUtils]: Spent 11.99 s on a formula simplification. DAG size of input: 601 DAG size of output: 8 [2020-09-04 21:39:46,772 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 4 [2020-09-04 21:39:57,587 WARN L193 SmtUtils]: Spent 10.81 s on a formula simplification. DAG size of input: 592 DAG size of output: 4 [2020-09-04 21:39:58,989 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 21:40:05,020 WARN L193 SmtUtils]: Spent 6.01 s on a formula simplification. DAG size of input: 459 DAG size of output: 4 [2020-09-04 21:40:07,250 WARN L193 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 309 DAG size of output: 4 [2020-09-04 21:40:08,714 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 256 DAG size of output: 4 [2020-09-04 21:40:09,549 WARN L193 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 4 [2020-09-04 21:40:11,001 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 21:40:21,974 WARN L193 SmtUtils]: Spent 10.96 s on a formula simplification. DAG size of input: 592 DAG size of output: 4 [2020-09-04 21:40:23,368 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 21:40:24,752 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 21:40:25,092 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 4 [2020-09-04 21:40:29,218 WARN L193 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 396 DAG size of output: 4 [2020-09-04 21:40:32,546 WARN L193 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 366 DAG size of output: 4 [2020-09-04 21:40:32,993 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 4 [2020-09-04 21:40:42,523 WARN L193 SmtUtils]: Spent 9.20 s on a formula simplification. DAG size of input: 499 DAG size of output: 4 [2020-09-04 21:40:55,748 WARN L193 SmtUtils]: Spent 13.22 s on a formula simplification. DAG size of input: 568 DAG size of output: 4 [2020-09-04 21:40:58,084 WARN L193 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 289 DAG size of output: 4 [2020-09-04 21:40:59,433 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 238 DAG size of output: 4 [2020-09-04 21:40:59,746 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 4 [2020-09-04 21:41:06,373 WARN L193 SmtUtils]: Spent 6.62 s on a formula simplification. DAG size of input: 434 DAG size of output: 4 [2020-09-04 21:41:09,856 WARN L193 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 344 DAG size of output: 4 [2020-09-04 21:41:20,537 WARN L193 SmtUtils]: Spent 10.68 s on a formula simplification. DAG size of input: 533 DAG size of output: 4 [2020-09-04 21:41:21,304 WARN L193 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 4 [2020-09-04 21:41:37,449 WARN L193 SmtUtils]: Spent 16.14 s on a formula simplification. DAG size of input: 578 DAG size of output: 8 [2020-09-04 21:41:37,616 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 4 [2020-09-04 21:41:53,801 WARN L193 SmtUtils]: Spent 16.18 s on a formula simplification. DAG size of input: 571 DAG size of output: 4 [2020-09-04 21:41:54,986 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 21:42:02,705 WARN L193 SmtUtils]: Spent 7.70 s on a formula simplification. DAG size of input: 466 DAG size of output: 4 [2020-09-04 21:42:05,529 WARN L193 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 316 DAG size of output: 4 [2020-09-04 21:42:07,317 WARN L193 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 263 DAG size of output: 4 [2020-09-04 21:42:08,331 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 214 DAG size of output: 4 [2020-09-04 21:42:09,567 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 21:42:25,997 WARN L193 SmtUtils]: Spent 16.43 s on a formula simplification. DAG size of input: 571 DAG size of output: 4 [2020-09-04 21:42:27,219 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 21:42:28,719 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 21:42:29,099 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 4 [2020-09-04 21:42:34,611 WARN L193 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 403 DAG size of output: 4 [2020-09-04 21:42:38,906 WARN L193 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 373 DAG size of output: 4 [2020-09-04 21:42:39,434 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 4 [2020-09-04 21:42:39,560 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 4 [2020-09-04 21:42:41,061 WARN L193 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 4 [2020-09-04 21:42:42,198 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 161 DAG size of output: 4 [2020-09-04 21:42:42,630 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 4 [2020-09-04 21:42:42,956 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 4 [2020-09-04 21:42:43,719 WARN L193 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:43,892 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 4 [2020-09-04 21:42:44,690 WARN L193 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 4 [2020-09-04 21:42:45,235 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 4 [2020-09-04 21:42:46,306 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 155 DAG size of output: 4 [2020-09-04 21:42:46,536 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 4 [2020-09-04 21:42:47,797 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 171 DAG size of output: 4 [2020-09-04 21:42:49,055 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 164 DAG size of output: 4 [2020-09-04 21:42:49,811 WARN L193 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:50,720 WARN L193 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 4 [2020-09-04 21:42:51,201 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 4 [2020-09-04 21:42:51,577 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 4 [2020-09-04 21:42:51,861 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 4 [2020-09-04 21:42:52,630 WARN L193 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:53,827 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 164 DAG size of output: 4 [2020-09-04 21:42:54,592 WARN L193 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:55,354 WARN L193 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:55,506 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 4 [2020-09-04 21:42:56,230 WARN L193 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 4 [2020-09-04 21:42:56,856 WARN L193 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 4 [2020-09-04 21:42:57,050 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 4 [2020-09-04 21:42:57,820 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 4 [2020-09-04 21:42:58,114 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 4 [2020-09-04 21:42:58,231 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 4 [2020-09-04 21:42:58,541 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:42:58,802 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 4 [2020-09-04 21:42:58,952 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 4 [2020-09-04 21:42:59,216 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 4 [2020-09-04 21:42:59,588 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 4 [2020-09-04 21:42:59,912 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 4 [2020-09-04 21:43:00,132 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:43:00,371 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 4 [2020-09-04 21:43:00,527 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 4 [2020-09-04 21:43:00,632 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 4 [2020-09-04 21:43:00,929 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:43:01,228 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 4 [2020-09-04 21:43:01,451 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:43:01,674 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:43:01,902 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 4 [2020-09-04 21:43:02,066 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 4 [2020-09-04 21:44:02,558 WARN L193 SmtUtils]: Spent 59.98 s on a formula simplification. DAG size of input: 957 DAG size of output: 9 [2020-09-04 21:45:33,794 WARN L193 SmtUtils]: Spent 1.52 m on a formula simplification. DAG size of input: 1093 DAG size of output: 9 [2020-09-04 21:45:46,238 WARN L193 SmtUtils]: Spent 12.44 s on a formula simplification. DAG size of input: 545 DAG size of output: 9 [2020-09-04 21:45:53,329 WARN L193 SmtUtils]: Spent 7.09 s on a formula simplification. DAG size of input: 445 DAG size of output: 9 [2020-09-04 21:47:01,466 WARN L193 SmtUtils]: Spent 1.14 m on a formula simplification. DAG size of input: 1495 DAG size of output: 9 [2020-09-04 21:47:01,695 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 9 [2020-09-04 21:47:02,825 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 231 DAG size of output: 9 [2020-09-04 21:47:42,907 WARN L193 SmtUtils]: Spent 40.06 s on a formula simplification. DAG size of input: 829 DAG size of output: 9 [2020-09-04 21:48:03,315 WARN L193 SmtUtils]: Spent 20.41 s on a formula simplification. DAG size of input: 653 DAG size of output: 9 [2020-09-04 21:49:14,914 WARN L193 SmtUtils]: Spent 1.19 m on a formula simplification. DAG size of input: 1024 DAG size of output: 9 [2020-09-04 21:49:18,632 WARN L193 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 353 DAG size of output: 9 [2020-09-04 21:51:04,778 WARN L193 SmtUtils]: Spent 1.77 m on a formula simplification. DAG size of input: 1154 DAG size of output: 11 [2020-09-04 21:51:05,484 WARN L193 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 9