/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:11:49,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:11:49,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:11:49,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:11:49,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:11:49,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:11:49,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:11:49,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:11:49,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:11:49,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:11:49,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:11:49,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:11:49,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:11:49,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:11:49,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:11:49,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:11:49,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:11:49,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:11:49,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:11:49,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:11:49,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:11:49,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:11:49,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:11:49,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:11:49,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:11:49,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:11:49,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:11:49,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:11:49,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:11:49,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:11:49,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:11:49,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:11:49,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:11:49,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:11:49,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:11:49,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:11:49,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:11:49,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:11:49,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:11:49,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:11:49,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:11:49,226 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 16:11:49,238 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:11:49,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:11:49,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:11:49,240 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:11:49,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:11:49,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:11:49,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:11:49,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:11:49,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:11:49,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:11:49,241 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:11:49,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:11:49,241 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:11:49,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:11:49,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:11:49,242 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:11:49,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:11:49,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:11:49,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:11:49,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:11:49,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:11:49,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:11:49,243 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:11:49,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:11:49,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:11:49,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:11:49,739 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:11:49,740 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:11:49,741 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2020-09-04 16:11:49,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b51e917e7/6f721f51656f4ceca2a4f7be0ec57be0/FLAG99807dd52 [2020-09-04 16:11:50,391 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:11:50,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2020-09-04 16:11:50,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b51e917e7/6f721f51656f4ceca2a4f7be0ec57be0/FLAG99807dd52 [2020-09-04 16:11:50,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b51e917e7/6f721f51656f4ceca2a4f7be0ec57be0 [2020-09-04 16:11:50,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:11:50,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:11:50,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:11:50,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:11:50,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:11:50,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:11:50" (1/1) ... [2020-09-04 16:11:50,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bf37f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:50, skipping insertion in model container [2020-09-04 16:11:50,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:11:50" (1/1) ... [2020-09-04 16:11:50,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:11:50,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:11:51,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:11:51,050 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:11:51,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:11:51,190 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:11:51,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51 WrapperNode [2020-09-04 16:11:51,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:11:51,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:11:51,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:11:51,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:11:51,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51" (1/1) ... [2020-09-04 16:11:51,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51" (1/1) ... [2020-09-04 16:11:51,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51" (1/1) ... [2020-09-04 16:11:51,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51" (1/1) ... [2020-09-04 16:11:51,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51" (1/1) ... [2020-09-04 16:11:51,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51" (1/1) ... [2020-09-04 16:11:51,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51" (1/1) ... [2020-09-04 16:11:51,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:11:51,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:11:51,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:11:51,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:11:51,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51" (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 16:11:51,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:11:51,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:11:51,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 16:11:51,330 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2020-09-04 16:11:51,330 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2020-09-04 16:11:51,330 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2020-09-04 16:11:51,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:11:51,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:11:51,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 16:11:51,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 16:11:51,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 16:11:51,332 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2020-09-04 16:11:51,333 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2020-09-04 16:11:51,333 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2020-09-04 16:11:51,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:11:51,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:11:51,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:11:51,850 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:11:51,850 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 16:11:51,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:11:51 BoogieIcfgContainer [2020-09-04 16:11:51,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:11:51,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:11:51,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:11:51,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:11:51,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:11:50" (1/3) ... [2020-09-04 16:11:51,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215e71a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:11:51, skipping insertion in model container [2020-09-04 16:11:51,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:51" (2/3) ... [2020-09-04 16:11:51,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215e71a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:11:51, skipping insertion in model container [2020-09-04 16:11:51,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:11:51" (3/3) ... [2020-09-04 16:11:51,867 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2020-09-04 16:11:51,878 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:11:51,888 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:11:51,907 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:11:51,934 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:11:51,935 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:11:51,935 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:11:51,935 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:11:51,935 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:11:51,935 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:11:51,936 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:11:51,936 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:11:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2020-09-04 16:11:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-09-04 16:11:51,976 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:51,977 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 16:11:51,977 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:51,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:51,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2062280112, now seen corresponding path program 1 times [2020-09-04 16:11:51,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:51,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [984528148] [2020-09-04 16:11:51,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:52,066 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 16:11:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 16:11:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 16:11:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,400 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 16:11:52,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [984528148] [2020-09-04 16:11:52,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:52,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 16:11:52,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302538282] [2020-09-04 16:11:52,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 16:11:52,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:52,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 16:11:52,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 16:11:52,442 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2020-09-04 16:11:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:52,610 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2020-09-04 16:11:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:11:52,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-09-04 16:11:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:52,634 INFO L225 Difference]: With dead ends: 286 [2020-09-04 16:11:52,634 INFO L226 Difference]: Without dead ends: 168 [2020-09-04 16:11:52,642 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 16:11:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-09-04 16:11:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 145. [2020-09-04 16:11:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-04 16:11:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2020-09-04 16:11:52,722 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 100 [2020-09-04 16:11:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:52,723 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2020-09-04 16:11:52,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 16:11:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2020-09-04 16:11:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-04 16:11:52,730 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:52,730 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 16:11:52,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:11:52,731 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:52,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1947593625, now seen corresponding path program 1 times [2020-09-04 16:11:52,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:52,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1875251537] [2020-09-04 16:11:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:52,735 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:11:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 16:11:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 16:11:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:52,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1875251537] [2020-09-04 16:11:52,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:52,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 16:11:52,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542762575] [2020-09-04 16:11:52,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 16:11:52,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 16:11:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 16:11:52,932 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand 4 states. [2020-09-04 16:11:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:53,083 INFO L93 Difference]: Finished difference Result 278 states and 331 transitions. [2020-09-04 16:11:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 16:11:53,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-09-04 16:11:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:53,089 INFO L225 Difference]: With dead ends: 278 [2020-09-04 16:11:53,089 INFO L226 Difference]: Without dead ends: 169 [2020-09-04 16:11:53,092 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 16:11:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-09-04 16:11:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2020-09-04 16:11:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-09-04 16:11:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2020-09-04 16:11:53,115 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 103 [2020-09-04 16:11:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:53,116 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2020-09-04 16:11:53,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 16:11:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2020-09-04 16:11:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:11:53,121 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:53,121 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 16:11:53,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:11:53,122 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1622356113, now seen corresponding path program 1 times [2020-09-04 16:11:53,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:53,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1171766725] [2020-09-04 16:11:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:53,125 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 16:11:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 16:11:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 16:11:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:53,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1171766725] [2020-09-04 16:11:53,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:53,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:11:53,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088476360] [2020-09-04 16:11:53,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:11:53,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:11:53,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:11:53,256 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. Second operand 5 states. [2020-09-04 16:11:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:53,356 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2020-09-04 16:11:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:11:53,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-04 16:11:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:53,359 INFO L225 Difference]: With dead ends: 314 [2020-09-04 16:11:53,360 INFO L226 Difference]: Without dead ends: 192 [2020-09-04 16:11:53,361 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 16:11:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-09-04 16:11:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 173. [2020-09-04 16:11:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-09-04 16:11:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2020-09-04 16:11:53,385 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 108 [2020-09-04 16:11:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:53,385 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2020-09-04 16:11:53,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:11:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2020-09-04 16:11:53,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:11:53,388 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:53,388 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 16:11:53,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:11:53,389 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:53,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:53,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1409900093, now seen corresponding path program 1 times [2020-09-04 16:11:53,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:53,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [574358328] [2020-09-04 16:11:53,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:53,392 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 16:11:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 16:11:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 16:11:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:53,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [574358328] [2020-09-04 16:11:53,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:53,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:11:53,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220765918] [2020-09-04 16:11:53,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:11:53,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:11:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:11:53,554 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 5 states. [2020-09-04 16:11:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:53,664 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2020-09-04 16:11:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:11:53,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-04 16:11:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:53,667 INFO L225 Difference]: With dead ends: 314 [2020-09-04 16:11:53,667 INFO L226 Difference]: Without dead ends: 194 [2020-09-04 16:11:53,668 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 16:11:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-09-04 16:11:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2020-09-04 16:11:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-09-04 16:11:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 207 transitions. [2020-09-04 16:11:53,696 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 207 transitions. Word has length 108 [2020-09-04 16:11:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:53,697 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 207 transitions. [2020-09-04 16:11:53,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:11:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 207 transitions. [2020-09-04 16:11:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 16:11:53,702 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:53,704 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 16:11:53,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:11:53,704 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2129807001, now seen corresponding path program 2 times [2020-09-04 16:11:53,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:53,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1382656521] [2020-09-04 16:11:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:53,707 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 16:11:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 16:11:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 16:11:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:53,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1382656521] [2020-09-04 16:11:53,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:53,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:11:53,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916661166] [2020-09-04 16:11:53,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:11:53,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:53,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:11:53,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:11:53,940 INFO L87 Difference]: Start difference. First operand 176 states and 207 transitions. Second operand 6 states. [2020-09-04 16:11:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:54,052 INFO L93 Difference]: Finished difference Result 348 states and 416 transitions. [2020-09-04 16:11:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:11:54,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-09-04 16:11:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:54,055 INFO L225 Difference]: With dead ends: 348 [2020-09-04 16:11:54,056 INFO L226 Difference]: Without dead ends: 218 [2020-09-04 16:11:54,057 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 16:11:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-09-04 16:11:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 186. [2020-09-04 16:11:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-04 16:11:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2020-09-04 16:11:54,088 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 113 [2020-09-04 16:11:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:54,090 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2020-09-04 16:11:54,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:11:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2020-09-04 16:11:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 16:11:54,092 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:54,092 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 16:11:54,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:11:54,093 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash -902449205, now seen corresponding path program 1 times [2020-09-04 16:11:54,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:54,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [827001421] [2020-09-04 16:11:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:54,096 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 16:11:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 16:11:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 16:11:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:54,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [827001421] [2020-09-04 16:11:54,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:54,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:11:54,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912919264] [2020-09-04 16:11:54,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:11:54,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:54,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:11:54,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:11:54,284 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 6 states. [2020-09-04 16:11:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:54,422 INFO L93 Difference]: Finished difference Result 342 states and 410 transitions. [2020-09-04 16:11:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:11:54,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-09-04 16:11:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:54,426 INFO L225 Difference]: With dead ends: 342 [2020-09-04 16:11:54,426 INFO L226 Difference]: Without dead ends: 214 [2020-09-04 16:11:54,427 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 16:11:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-09-04 16:11:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 186. [2020-09-04 16:11:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-04 16:11:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2020-09-04 16:11:54,453 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 113 [2020-09-04 16:11:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:54,454 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2020-09-04 16:11:54,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:11:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2020-09-04 16:11:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-04 16:11:54,457 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:54,457 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 16:11:54,457 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:11:54,457 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:54,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash 139965841, now seen corresponding path program 3 times [2020-09-04 16:11:54,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:54,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1270921693] [2020-09-04 16:11:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:54,461 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 16:11:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 16:11:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 16:11:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:54,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1270921693] [2020-09-04 16:11:54,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:54,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:11:54,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608632487] [2020-09-04 16:11:54,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:11:54,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:54,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:11:54,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:11:54,639 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 7 states. [2020-09-04 16:11:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:54,772 INFO L93 Difference]: Finished difference Result 375 states and 449 transitions. [2020-09-04 16:11:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:11:54,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2020-09-04 16:11:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:54,776 INFO L225 Difference]: With dead ends: 375 [2020-09-04 16:11:54,776 INFO L226 Difference]: Without dead ends: 240 [2020-09-04 16:11:54,777 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 16:11:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-09-04 16:11:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 196. [2020-09-04 16:11:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-09-04 16:11:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-09-04 16:11:54,796 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 118 [2020-09-04 16:11:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:54,797 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-09-04 16:11:54,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:11:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-09-04 16:11:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-04 16:11:54,799 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:54,799 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 16:11:54,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:11:54,800 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:54,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1402676931, now seen corresponding path program 2 times [2020-09-04 16:11:54,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:54,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [350594063] [2020-09-04 16:11:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:54,803 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 16:11:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 16:11:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 16:11:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:54,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [350594063] [2020-09-04 16:11:54,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:54,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:11:54,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17067848] [2020-09-04 16:11:54,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:11:54,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:54,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:11:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:11:54,991 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 7 states. [2020-09-04 16:11:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:55,128 INFO L93 Difference]: Finished difference Result 361 states and 435 transitions. [2020-09-04 16:11:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:11:55,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2020-09-04 16:11:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:55,131 INFO L225 Difference]: With dead ends: 361 [2020-09-04 16:11:55,131 INFO L226 Difference]: Without dead ends: 228 [2020-09-04 16:11:55,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:11:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-09-04 16:11:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 196. [2020-09-04 16:11:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-09-04 16:11:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-09-04 16:11:55,169 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 118 [2020-09-04 16:11:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:55,169 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-09-04 16:11:55,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:11:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-09-04 16:11:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 16:11:55,172 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:55,172 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 16:11:55,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:11:55,173 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:55,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:55,173 INFO L82 PathProgramCache]: Analyzing trace with hash -229056103, now seen corresponding path program 4 times [2020-09-04 16:11:55,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:55,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [525839615] [2020-09-04 16:11:55,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:55,176 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 16:11:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 16:11:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-04 16:11:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:55,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [525839615] [2020-09-04 16:11:55,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:55,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:11:55,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603255130] [2020-09-04 16:11:55,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:11:55,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:55,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:11:55,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:11:55,348 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 8 states. [2020-09-04 16:11:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:55,514 INFO L93 Difference]: Finished difference Result 402 states and 482 transitions. [2020-09-04 16:11:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:11:55,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-04 16:11:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:55,517 INFO L225 Difference]: With dead ends: 402 [2020-09-04 16:11:55,517 INFO L226 Difference]: Without dead ends: 262 [2020-09-04 16:11:55,518 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 16:11:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-09-04 16:11:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 206. [2020-09-04 16:11:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 16:11:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2020-09-04 16:11:55,541 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 123 [2020-09-04 16:11:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:55,541 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2020-09-04 16:11:55,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:11:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2020-09-04 16:11:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 16:11:55,543 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:55,544 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 16:11:55,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:11:55,544 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:55,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1033654987, now seen corresponding path program 3 times [2020-09-04 16:11:55,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:55,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697998935] [2020-09-04 16:11:55,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:55,548 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 16:11:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 16:11:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-04 16:11:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:55,774 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697998935] [2020-09-04 16:11:55,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:55,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:11:55,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094312978] [2020-09-04 16:11:55,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:11:55,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:55,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:11:55,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:11:55,776 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand 8 states. [2020-09-04 16:11:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:55,958 INFO L93 Difference]: Finished difference Result 380 states and 460 transitions. [2020-09-04 16:11:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:11:55,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-04 16:11:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:55,962 INFO L225 Difference]: With dead ends: 380 [2020-09-04 16:11:55,962 INFO L226 Difference]: Without dead ends: 242 [2020-09-04 16:11:55,964 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 16:11:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-09-04 16:11:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 206. [2020-09-04 16:11:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 16:11:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2020-09-04 16:11:55,990 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 123 [2020-09-04 16:11:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:55,990 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2020-09-04 16:11:55,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:11:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2020-09-04 16:11:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 16:11:55,992 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:55,993 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 16:11:55,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:11:55,993 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:55,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1138358929, now seen corresponding path program 5 times [2020-09-04 16:11:55,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:55,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2042654875] [2020-09-04 16:11:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:55,997 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 16:11:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 16:11:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 16:11:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:56,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2042654875] [2020-09-04 16:11:56,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:56,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:11:56,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812126055] [2020-09-04 16:11:56,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:11:56,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:11:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:11:56,187 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand 9 states. [2020-09-04 16:11:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:56,351 INFO L93 Difference]: Finished difference Result 429 states and 515 transitions. [2020-09-04 16:11:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:11:56,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-09-04 16:11:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:56,354 INFO L225 Difference]: With dead ends: 429 [2020-09-04 16:11:56,354 INFO L226 Difference]: Without dead ends: 284 [2020-09-04 16:11:56,355 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 16:11:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-09-04 16:11:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 216. [2020-09-04 16:11:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-09-04 16:11:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2020-09-04 16:11:56,378 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 128 [2020-09-04 16:11:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:56,378 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2020-09-04 16:11:56,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:11:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2020-09-04 16:11:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 16:11:56,381 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:56,381 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 16:11:56,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:11:56,381 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:56,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1893897277, now seen corresponding path program 4 times [2020-09-04 16:11:56,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:56,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1811986791] [2020-09-04 16:11:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:56,384 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 16:11:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 16:11:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 16:11:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:56,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1811986791] [2020-09-04 16:11:56,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:56,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:11:56,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324292100] [2020-09-04 16:11:56,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:11:56,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:11:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:11:56,586 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand 9 states. [2020-09-04 16:11:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:56,792 INFO L93 Difference]: Finished difference Result 399 states and 485 transitions. [2020-09-04 16:11:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:11:56,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-09-04 16:11:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:56,795 INFO L225 Difference]: With dead ends: 399 [2020-09-04 16:11:56,795 INFO L226 Difference]: Without dead ends: 256 [2020-09-04 16:11:56,796 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 16:11:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-09-04 16:11:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 216. [2020-09-04 16:11:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-09-04 16:11:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2020-09-04 16:11:56,823 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 128 [2020-09-04 16:11:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:56,823 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2020-09-04 16:11:56,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:11:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2020-09-04 16:11:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 16:11:56,826 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:56,826 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 16:11:56,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:11:56,826 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1450818713, now seen corresponding path program 6 times [2020-09-04 16:11:56,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:56,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [54570401] [2020-09-04 16:11:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:56,829 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:11:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 16:11:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 16:11:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:57,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [54570401] [2020-09-04 16:11:57,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:57,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:11:57,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126836862] [2020-09-04 16:11:57,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:11:57,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:57,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:11:57,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:11:57,020 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand 10 states. [2020-09-04 16:11:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:57,190 INFO L93 Difference]: Finished difference Result 456 states and 548 transitions. [2020-09-04 16:11:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:11:57,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-09-04 16:11:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:57,193 INFO L225 Difference]: With dead ends: 456 [2020-09-04 16:11:57,193 INFO L226 Difference]: Without dead ends: 306 [2020-09-04 16:11:57,195 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 16:11:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-09-04 16:11:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 226. [2020-09-04 16:11:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-09-04 16:11:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 272 transitions. [2020-09-04 16:11:57,220 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 272 transitions. Word has length 133 [2020-09-04 16:11:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:57,220 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 272 transitions. [2020-09-04 16:11:57,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:11:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 272 transitions. [2020-09-04 16:11:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 16:11:57,223 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:57,223 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 16:11:57,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:11:57,224 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1581437493, now seen corresponding path program 5 times [2020-09-04 16:11:57,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:57,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545160610] [2020-09-04 16:11:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:57,227 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:11:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 16:11:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 16:11:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:57,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545160610] [2020-09-04 16:11:57,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:57,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:11:57,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626870550] [2020-09-04 16:11:57,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:11:57,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:57,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:11:57,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:11:57,448 INFO L87 Difference]: Start difference. First operand 226 states and 272 transitions. Second operand 10 states. [2020-09-04 16:11:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:57,643 INFO L93 Difference]: Finished difference Result 418 states and 510 transitions. [2020-09-04 16:11:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:11:57,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-09-04 16:11:57,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:57,646 INFO L225 Difference]: With dead ends: 418 [2020-09-04 16:11:57,647 INFO L226 Difference]: Without dead ends: 270 [2020-09-04 16:11:57,648 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 16:11:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-09-04 16:11:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 226. [2020-09-04 16:11:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-09-04 16:11:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 272 transitions. [2020-09-04 16:11:57,671 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 272 transitions. Word has length 133 [2020-09-04 16:11:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:57,672 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 272 transitions. [2020-09-04 16:11:57,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:11:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 272 transitions. [2020-09-04 16:11:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 16:11:57,674 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:57,675 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 16:11:57,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:11:57,675 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:57,676 INFO L82 PathProgramCache]: Analyzing trace with hash 688521105, now seen corresponding path program 7 times [2020-09-04 16:11:57,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:57,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853381003] [2020-09-04 16:11:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:57,678 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 16:11:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 16:11:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 16:11:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:57,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853381003] [2020-09-04 16:11:57,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:57,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:11:57,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908856293] [2020-09-04 16:11:57,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:11:57,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:57,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:11:57,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:11:57,898 INFO L87 Difference]: Start difference. First operand 226 states and 272 transitions. Second operand 11 states. [2020-09-04 16:11:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:58,053 INFO L93 Difference]: Finished difference Result 483 states and 581 transitions. [2020-09-04 16:11:58,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:11:58,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2020-09-04 16:11:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:58,057 INFO L225 Difference]: With dead ends: 483 [2020-09-04 16:11:58,058 INFO L226 Difference]: Without dead ends: 328 [2020-09-04 16:11:58,060 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 16:11:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-09-04 16:11:58,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 236. [2020-09-04 16:11:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 16:11:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2020-09-04 16:11:58,083 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 138 [2020-09-04 16:11:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:58,084 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2020-09-04 16:11:58,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:11:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2020-09-04 16:11:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 16:11:58,086 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:58,086 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 16:11:58,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:11:58,087 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:58,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:58,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1951232195, now seen corresponding path program 6 times [2020-09-04 16:11:58,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:58,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849399701] [2020-09-04 16:11:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:58,091 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 16:11:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 16:11:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 16:11:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:58,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849399701] [2020-09-04 16:11:58,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:58,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:11:58,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495139199] [2020-09-04 16:11:58,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:11:58,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:58,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:11:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:11:58,487 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 11 states. [2020-09-04 16:11:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:58,854 INFO L93 Difference]: Finished difference Result 437 states and 535 transitions. [2020-09-04 16:11:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:11:58,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2020-09-04 16:11:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:58,858 INFO L225 Difference]: With dead ends: 437 [2020-09-04 16:11:58,859 INFO L226 Difference]: Without dead ends: 284 [2020-09-04 16:11:58,860 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 16:11:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-09-04 16:11:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2020-09-04 16:11:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 16:11:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2020-09-04 16:11:58,919 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 138 [2020-09-04 16:11:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:58,920 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2020-09-04 16:11:58,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:11:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2020-09-04 16:11:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-04 16:11:58,922 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:58,922 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 16:11:58,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:11:58,923 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:58,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1216030823, now seen corresponding path program 8 times [2020-09-04 16:11:58,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:58,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59267425] [2020-09-04 16:11:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:58,925 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 16:11:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 16:11:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 16:11:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:59,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59267425] [2020-09-04 16:11:59,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:59,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:11:59,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087442149] [2020-09-04 16:11:59,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:11:59,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:59,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:11:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:11:59,176 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 12 states. [2020-09-04 16:11:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:59,382 INFO L93 Difference]: Finished difference Result 510 states and 614 transitions. [2020-09-04 16:11:59,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:11:59,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-09-04 16:11:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:59,386 INFO L225 Difference]: With dead ends: 510 [2020-09-04 16:11:59,386 INFO L226 Difference]: Without dead ends: 350 [2020-09-04 16:11:59,387 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 16:11:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-09-04 16:11:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 246. [2020-09-04 16:11:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-09-04 16:11:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 298 transitions. [2020-09-04 16:11:59,412 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 298 transitions. Word has length 143 [2020-09-04 16:11:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:59,413 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 298 transitions. [2020-09-04 16:11:59,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:11:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 298 transitions. [2020-09-04 16:11:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-04 16:11:59,415 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:59,415 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 16:11:59,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:11:59,416 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:59,416 INFO L82 PathProgramCache]: Analyzing trace with hash 46680267, now seen corresponding path program 7 times [2020-09-04 16:11:59,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:59,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1537510356] [2020-09-04 16:11:59,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:59,418 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 16:11:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 16:11:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 16:11:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:59,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1537510356] [2020-09-04 16:11:59,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:59,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:11:59,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174975427] [2020-09-04 16:11:59,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:11:59,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:11:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:11:59,733 INFO L87 Difference]: Start difference. First operand 246 states and 298 transitions. Second operand 12 states. [2020-09-04 16:12:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:00,076 INFO L93 Difference]: Finished difference Result 456 states and 560 transitions. [2020-09-04 16:12:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:12:00,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-09-04 16:12:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:00,079 INFO L225 Difference]: With dead ends: 456 [2020-09-04 16:12:00,079 INFO L226 Difference]: Without dead ends: 298 [2020-09-04 16:12:00,080 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 16:12:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-09-04 16:12:00,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 246. [2020-09-04 16:12:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-09-04 16:12:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 298 transitions. [2020-09-04 16:12:00,104 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 298 transitions. Word has length 143 [2020-09-04 16:12:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:00,105 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 298 transitions. [2020-09-04 16:12:00,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:12:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 298 transitions. [2020-09-04 16:12:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 16:12:00,107 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:00,108 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 16:12:00,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:12:00,108 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash -910703471, now seen corresponding path program 9 times [2020-09-04 16:12:00,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:00,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2140328041] [2020-09-04 16:12:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:00,110 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-04 16:12:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-09-04 16:12:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 16:12:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:00,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2140328041] [2020-09-04 16:12:00,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:00,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:12:00,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378548037] [2020-09-04 16:12:00,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:12:00,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:00,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:12:00,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:12:00,377 INFO L87 Difference]: Start difference. First operand 246 states and 298 transitions. Second operand 13 states. [2020-09-04 16:12:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:00,632 INFO L93 Difference]: Finished difference Result 537 states and 647 transitions. [2020-09-04 16:12:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:12:00,633 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2020-09-04 16:12:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:00,635 INFO L225 Difference]: With dead ends: 537 [2020-09-04 16:12:00,635 INFO L226 Difference]: Without dead ends: 372 [2020-09-04 16:12:00,637 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 16:12:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-09-04 16:12:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 256. [2020-09-04 16:12:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 16:12:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2020-09-04 16:12:00,664 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 148 [2020-09-04 16:12:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:00,664 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2020-09-04 16:12:00,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:12:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2020-09-04 16:12:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 16:12:00,666 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:00,667 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 16:12:00,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:12:00,667 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash 352007619, now seen corresponding path program 8 times [2020-09-04 16:12:00,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:00,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [813559170] [2020-09-04 16:12:00,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:00,670 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-04 16:12:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-09-04 16:12:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 16:12:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:00,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [813559170] [2020-09-04 16:12:00,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:00,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:12:00,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826526108] [2020-09-04 16:12:00,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:12:00,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:00,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:12:00,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:12:00,974 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand 13 states. [2020-09-04 16:12:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:01,386 INFO L93 Difference]: Finished difference Result 475 states and 585 transitions. [2020-09-04 16:12:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:12:01,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2020-09-04 16:12:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:01,389 INFO L225 Difference]: With dead ends: 475 [2020-09-04 16:12:01,389 INFO L226 Difference]: Without dead ends: 312 [2020-09-04 16:12:01,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:12:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-09-04 16:12:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 256. [2020-09-04 16:12:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 16:12:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2020-09-04 16:12:01,423 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 148 [2020-09-04 16:12:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:01,424 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2020-09-04 16:12:01,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:12:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2020-09-04 16:12:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 16:12:01,426 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:01,426 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 16:12:01,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:12:01,427 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:01,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1515572583, now seen corresponding path program 10 times [2020-09-04 16:12:01,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:01,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112006489] [2020-09-04 16:12:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:01,430 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 16:12:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 16:12:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 16:12:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:01,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112006489] [2020-09-04 16:12:01,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:01,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:12:01,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358917899] [2020-09-04 16:12:01,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:12:01,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:01,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:12:01,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:12:01,683 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand 14 states. [2020-09-04 16:12:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:01,879 INFO L93 Difference]: Finished difference Result 564 states and 680 transitions. [2020-09-04 16:12:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:12:01,880 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2020-09-04 16:12:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:01,883 INFO L225 Difference]: With dead ends: 564 [2020-09-04 16:12:01,883 INFO L226 Difference]: Without dead ends: 394 [2020-09-04 16:12:01,884 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 16:12:01,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-09-04 16:12:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 266. [2020-09-04 16:12:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-09-04 16:12:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2020-09-04 16:12:01,913 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 153 [2020-09-04 16:12:01,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:01,914 INFO L479 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2020-09-04 16:12:01,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:12:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2020-09-04 16:12:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 16:12:01,916 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:01,916 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 16:12:01,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:12:01,917 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash -252861493, now seen corresponding path program 9 times [2020-09-04 16:12:01,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:01,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613707039] [2020-09-04 16:12:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:01,919 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 16:12:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 16:12:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 16:12:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:02,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613707039] [2020-09-04 16:12:02,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:02,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:12:02,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960092255] [2020-09-04 16:12:02,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:12:02,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:02,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:12:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:12:02,336 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand 14 states. [2020-09-04 16:12:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:02,818 INFO L93 Difference]: Finished difference Result 494 states and 610 transitions. [2020-09-04 16:12:02,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:12:02,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2020-09-04 16:12:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:02,820 INFO L225 Difference]: With dead ends: 494 [2020-09-04 16:12:02,821 INFO L226 Difference]: Without dead ends: 326 [2020-09-04 16:12:02,822 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 16:12:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-09-04 16:12:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2020-09-04 16:12:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-09-04 16:12:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2020-09-04 16:12:02,850 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 153 [2020-09-04 16:12:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:02,850 INFO L479 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2020-09-04 16:12:02,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:12:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2020-09-04 16:12:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-04 16:12:02,853 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:02,853 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 16:12:02,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 16:12:02,853 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash 867387793, now seen corresponding path program 11 times [2020-09-04 16:12:02,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:02,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [639374317] [2020-09-04 16:12:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:02,857 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 16:12:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 16:12:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 16:12:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:03,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [639374317] [2020-09-04 16:12:03,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:03,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:12:03,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848672925] [2020-09-04 16:12:03,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:12:03,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:03,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:12:03,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:03,166 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand 15 states. [2020-09-04 16:12:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:03,450 INFO L93 Difference]: Finished difference Result 591 states and 713 transitions. [2020-09-04 16:12:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:12:03,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2020-09-04 16:12:03,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:03,455 INFO L225 Difference]: With dead ends: 591 [2020-09-04 16:12:03,455 INFO L226 Difference]: Without dead ends: 416 [2020-09-04 16:12:03,457 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 16:12:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-09-04 16:12:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 276. [2020-09-04 16:12:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-09-04 16:12:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2020-09-04 16:12:03,492 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 158 [2020-09-04 16:12:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:03,493 INFO L479 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2020-09-04 16:12:03,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:12:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2020-09-04 16:12:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-04 16:12:03,495 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:03,495 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 16:12:03,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 16:12:03,495 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2130098883, now seen corresponding path program 10 times [2020-09-04 16:12:03,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:03,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1549009009] [2020-09-04 16:12:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:03,498 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 16:12:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 16:12:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 16:12:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:03,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1549009009] [2020-09-04 16:12:03,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:03,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:12:03,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87885743] [2020-09-04 16:12:03,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:12:03,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:12:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:03,870 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand 15 states. [2020-09-04 16:12:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:04,340 INFO L93 Difference]: Finished difference Result 513 states and 635 transitions. [2020-09-04 16:12:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:12:04,341 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2020-09-04 16:12:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:04,343 INFO L225 Difference]: With dead ends: 513 [2020-09-04 16:12:04,343 INFO L226 Difference]: Without dead ends: 340 [2020-09-04 16:12:04,345 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 16:12:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-09-04 16:12:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 276. [2020-09-04 16:12:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-09-04 16:12:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2020-09-04 16:12:04,379 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 158 [2020-09-04 16:12:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:04,380 INFO L479 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2020-09-04 16:12:04,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:12:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2020-09-04 16:12:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-04 16:12:04,383 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:04,384 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 16:12:04,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 16:12:04,384 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash 890883481, now seen corresponding path program 12 times [2020-09-04 16:12:04,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:04,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1856994830] [2020-09-04 16:12:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:04,387 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 16:12:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 16:12:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 16:12:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:04,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1856994830] [2020-09-04 16:12:04,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:04,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:12:04,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174741529] [2020-09-04 16:12:04,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:12:04,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:12:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:12:04,702 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand 16 states. [2020-09-04 16:12:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:04,963 INFO L93 Difference]: Finished difference Result 618 states and 746 transitions. [2020-09-04 16:12:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:12:04,963 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 163 [2020-09-04 16:12:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:04,967 INFO L225 Difference]: With dead ends: 618 [2020-09-04 16:12:04,967 INFO L226 Difference]: Without dead ends: 438 [2020-09-04 16:12:04,968 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 16:12:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-09-04 16:12:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2020-09-04 16:12:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-09-04 16:12:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 350 transitions. [2020-09-04 16:12:05,004 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 350 transitions. Word has length 163 [2020-09-04 16:12:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:05,005 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 350 transitions. [2020-09-04 16:12:05,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:12:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 350 transitions. [2020-09-04 16:12:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-04 16:12:05,008 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:05,008 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 16:12:05,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 16:12:05,008 INFO L427 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372725, now seen corresponding path program 11 times [2020-09-04 16:12:05,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:05,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1836887151] [2020-09-04 16:12:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:05,011 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 16:12:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 16:12:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 16:12:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:05,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1836887151] [2020-09-04 16:12:05,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:05,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:12:05,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113656647] [2020-09-04 16:12:05,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:12:05,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:05,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:12:05,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:12:05,457 INFO L87 Difference]: Start difference. First operand 286 states and 350 transitions. Second operand 16 states. [2020-09-04 16:12:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:06,021 INFO L93 Difference]: Finished difference Result 532 states and 660 transitions. [2020-09-04 16:12:06,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:12:06,022 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 163 [2020-09-04 16:12:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:06,026 INFO L225 Difference]: With dead ends: 532 [2020-09-04 16:12:06,026 INFO L226 Difference]: Without dead ends: 354 [2020-09-04 16:12:06,027 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 16:12:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-09-04 16:12:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 286. [2020-09-04 16:12:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-09-04 16:12:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 350 transitions. [2020-09-04 16:12:06,054 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 350 transitions. Word has length 163 [2020-09-04 16:12:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:06,055 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 350 transitions. [2020-09-04 16:12:06,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:12:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 350 transitions. [2020-09-04 16:12:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 16:12:06,057 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:06,057 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 16:12:06,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 16:12:06,058 INFO L427 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:06,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1892454033, now seen corresponding path program 13 times [2020-09-04 16:12:06,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:06,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1639425047] [2020-09-04 16:12:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:06,060 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 16:12:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 16:12:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 16:12:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:06,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1639425047] [2020-09-04 16:12:06,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:06,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:12:06,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319050747] [2020-09-04 16:12:06,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:12:06,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:06,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:12:06,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:12:06,399 INFO L87 Difference]: Start difference. First operand 286 states and 350 transitions. Second operand 17 states. [2020-09-04 16:12:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:06,752 INFO L93 Difference]: Finished difference Result 645 states and 779 transitions. [2020-09-04 16:12:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:12:06,753 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-09-04 16:12:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:06,756 INFO L225 Difference]: With dead ends: 645 [2020-09-04 16:12:06,756 INFO L226 Difference]: Without dead ends: 460 [2020-09-04 16:12:06,758 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 16:12:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-09-04 16:12:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 296. [2020-09-04 16:12:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 16:12:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2020-09-04 16:12:06,793 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 168 [2020-09-04 16:12:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:06,793 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2020-09-04 16:12:06,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:12:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2020-09-04 16:12:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 16:12:06,796 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:06,796 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 16:12:06,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-04 16:12:06,796 INFO L427 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1139802173, now seen corresponding path program 12 times [2020-09-04 16:12:06,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:06,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905589902] [2020-09-04 16:12:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:06,799 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 16:12:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 16:12:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 16:12:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:07,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905589902] [2020-09-04 16:12:07,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:07,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:12:07,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561853344] [2020-09-04 16:12:07,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:12:07,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:07,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:12:07,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:12:07,235 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 17 states. [2020-09-04 16:12:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:07,942 INFO L93 Difference]: Finished difference Result 551 states and 685 transitions. [2020-09-04 16:12:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:12:07,943 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-09-04 16:12:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:07,945 INFO L225 Difference]: With dead ends: 551 [2020-09-04 16:12:07,946 INFO L226 Difference]: Without dead ends: 368 [2020-09-04 16:12:07,947 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:12:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2020-09-04 16:12:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 296. [2020-09-04 16:12:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 16:12:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2020-09-04 16:12:07,978 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 168 [2020-09-04 16:12:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:07,979 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2020-09-04 16:12:07,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:12:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2020-09-04 16:12:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-04 16:12:07,982 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:07,982 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 16:12:07,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-04 16:12:07,983 INFO L427 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash -33314663, now seen corresponding path program 14 times [2020-09-04 16:12:07,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:07,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399471701] [2020-09-04 16:12:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:07,988 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-09-04 16:12:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 16:12:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 16:12:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:08,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399471701] [2020-09-04 16:12:08,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:08,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:12:08,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822394846] [2020-09-04 16:12:08,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:12:08,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:12:08,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:12:08,396 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 18 states. [2020-09-04 16:12:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:08,732 INFO L93 Difference]: Finished difference Result 672 states and 812 transitions. [2020-09-04 16:12:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:12:08,738 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2020-09-04 16:12:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:08,741 INFO L225 Difference]: With dead ends: 672 [2020-09-04 16:12:08,742 INFO L226 Difference]: Without dead ends: 482 [2020-09-04 16:12:08,743 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 16:12:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-09-04 16:12:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 306. [2020-09-04 16:12:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-09-04 16:12:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 376 transitions. [2020-09-04 16:12:08,777 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 376 transitions. Word has length 173 [2020-09-04 16:12:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:08,777 INFO L479 AbstractCegarLoop]: Abstraction has 306 states and 376 transitions. [2020-09-04 16:12:08,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:12:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 376 transitions. [2020-09-04 16:12:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-04 16:12:08,781 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:08,781 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 16:12:08,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-04 16:12:08,782 INFO L427 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:08,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:08,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1229396427, now seen corresponding path program 13 times [2020-09-04 16:12:08,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:08,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [172907538] [2020-09-04 16:12:08,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:08,784 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-09-04 16:12:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 16:12:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 16:12:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:09,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [172907538] [2020-09-04 16:12:09,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:09,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:12:09,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079423203] [2020-09-04 16:12:09,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:12:09,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:09,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:12:09,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:12:09,293 INFO L87 Difference]: Start difference. First operand 306 states and 376 transitions. Second operand 18 states. [2020-09-04 16:12:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:09,916 INFO L93 Difference]: Finished difference Result 570 states and 710 transitions. [2020-09-04 16:12:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:12:09,917 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2020-09-04 16:12:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:09,919 INFO L225 Difference]: With dead ends: 570 [2020-09-04 16:12:09,919 INFO L226 Difference]: Without dead ends: 382 [2020-09-04 16:12:09,921 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 16:12:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-09-04 16:12:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 306. [2020-09-04 16:12:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-09-04 16:12:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 376 transitions. [2020-09-04 16:12:09,951 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 376 transitions. Word has length 173 [2020-09-04 16:12:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:09,952 INFO L479 AbstractCegarLoop]: Abstraction has 306 states and 376 transitions. [2020-09-04 16:12:09,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:12:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 376 transitions. [2020-09-04 16:12:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-09-04 16:12:09,969 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:09,970 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 16:12:09,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-04 16:12:09,970 INFO L427 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:09,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:09,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2032954479, now seen corresponding path program 15 times [2020-09-04 16:12:09,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:09,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1236394700] [2020-09-04 16:12:09,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:09,972 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 16:12:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 16:12:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-09-04 16:12:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 16:12:10,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1236394700] [2020-09-04 16:12:10,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:10,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:12:10,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128524891] [2020-09-04 16:12:10,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:12:10,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:10,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:12:10,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:12:10,057 INFO L87 Difference]: Start difference. First operand 306 states and 376 transitions. Second operand 3 states. [2020-09-04 16:12:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:10,084 INFO L93 Difference]: Finished difference Result 321 states and 393 transitions. [2020-09-04 16:12:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:12:10,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-09-04 16:12:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:10,086 INFO L225 Difference]: With dead ends: 321 [2020-09-04 16:12:10,086 INFO L226 Difference]: Without dead ends: 305 [2020-09-04 16:12:10,087 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 16:12:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-09-04 16:12:10,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2020-09-04 16:12:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-09-04 16:12:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 374 transitions. [2020-09-04 16:12:10,114 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 374 transitions. Word has length 178 [2020-09-04 16:12:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:10,115 INFO L479 AbstractCegarLoop]: Abstraction has 305 states and 374 transitions. [2020-09-04 16:12:10,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:12:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2020-09-04 16:12:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:12:10,117 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:10,117 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 16:12:10,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-04 16:12:10,117 INFO L427 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash 368593816, now seen corresponding path program 1 times [2020-09-04 16:12:10,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:10,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1928248139] [2020-09-04 16:12:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:10,120 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 16:12:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 16:12:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 16:12:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 16:12:10,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1928248139] [2020-09-04 16:12:10,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:10,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 16:12:10,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972213051] [2020-09-04 16:12:10,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 16:12:10,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 16:12:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 16:12:10,208 INFO L87 Difference]: Start difference. First operand 305 states and 374 transitions. Second operand 4 states. [2020-09-04 16:12:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:10,245 INFO L93 Difference]: Finished difference Result 321 states and 392 transitions. [2020-09-04 16:12:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 16:12:10,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-09-04 16:12:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:10,248 INFO L225 Difference]: With dead ends: 321 [2020-09-04 16:12:10,248 INFO L226 Difference]: Without dead ends: 304 [2020-09-04 16:12:10,248 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 16:12:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-04 16:12:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-09-04 16:12:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-09-04 16:12:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 372 transitions. [2020-09-04 16:12:10,285 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 372 transitions. Word has length 180 [2020-09-04 16:12:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:10,285 INFO L479 AbstractCegarLoop]: Abstraction has 304 states and 372 transitions. [2020-09-04 16:12:10,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 16:12:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 372 transitions. [2020-09-04 16:12:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:12:10,287 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:10,287 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 16:12:10,287 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-04 16:12:10,288 INFO L427 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1683689272, now seen corresponding path program 1 times [2020-09-04 16:12:10,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:10,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1337988949] [2020-09-04 16:12:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:10,300 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 16:12:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 16:12:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 16:12:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:10,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1337988949] [2020-09-04 16:12:10,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:10,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:12:10,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944254842] [2020-09-04 16:12:10,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:12:10,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:10,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:12:10,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:12:10,751 INFO L87 Difference]: Start difference. First operand 304 states and 372 transitions. Second operand 19 states. [2020-09-04 16:12:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:11,139 INFO L93 Difference]: Finished difference Result 695 states and 837 transitions. [2020-09-04 16:12:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:12:11,139 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2020-09-04 16:12:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:11,143 INFO L225 Difference]: With dead ends: 695 [2020-09-04 16:12:11,143 INFO L226 Difference]: Without dead ends: 502 [2020-09-04 16:12:11,145 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 16:12:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-09-04 16:12:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 314. [2020-09-04 16:12:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-09-04 16:12:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2020-09-04 16:12:11,196 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 180 [2020-09-04 16:12:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:11,196 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2020-09-04 16:12:11,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:12:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2020-09-04 16:12:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:12:11,198 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:11,198 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 16:12:11,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-04 16:12:11,199 INFO L427 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:11,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:11,199 INFO L82 PathProgramCache]: Analyzing trace with hash -326698006, now seen corresponding path program 1 times [2020-09-04 16:12:11,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:11,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2086933909] [2020-09-04 16:12:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:11,201 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 16:12:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 16:12:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 16:12:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:11,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2086933909] [2020-09-04 16:12:11,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:11,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:12:11,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061485747] [2020-09-04 16:12:11,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:12:11,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:11,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:12:11,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:12:11,732 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 19 states. [2020-09-04 16:12:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:12,463 INFO L93 Difference]: Finished difference Result 585 states and 727 transitions. [2020-09-04 16:12:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:12:12,466 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2020-09-04 16:12:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:12,469 INFO L225 Difference]: With dead ends: 585 [2020-09-04 16:12:12,472 INFO L226 Difference]: Without dead ends: 394 [2020-09-04 16:12:12,474 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 16:12:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-09-04 16:12:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 314. [2020-09-04 16:12:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-09-04 16:12:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2020-09-04 16:12:12,506 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 180 [2020-09-04 16:12:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:12,507 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2020-09-04 16:12:12,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:12:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2020-09-04 16:12:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-09-04 16:12:12,508 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:12,509 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 16:12:12,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-04 16:12:12,509 INFO L427 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1714201280, now seen corresponding path program 2 times [2020-09-04 16:12:12,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:12,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2010987663] [2020-09-04 16:12:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:12,516 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 16:12:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-09-04 16:12:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 16:12:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:12,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2010987663] [2020-09-04 16:12:12,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:12,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:12:12,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826180736] [2020-09-04 16:12:12,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:12:12,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:12,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:12:12,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:12:12,958 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 20 states. [2020-09-04 16:12:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:13,342 INFO L93 Difference]: Finished difference Result 722 states and 870 transitions. [2020-09-04 16:12:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:12:13,343 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 185 [2020-09-04 16:12:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:13,346 INFO L225 Difference]: With dead ends: 722 [2020-09-04 16:12:13,346 INFO L226 Difference]: Without dead ends: 524 [2020-09-04 16:12:13,348 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 16:12:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-09-04 16:12:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 324. [2020-09-04 16:12:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-09-04 16:12:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 398 transitions. [2020-09-04 16:12:13,381 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 398 transitions. Word has length 185 [2020-09-04 16:12:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:13,381 INFO L479 AbstractCegarLoop]: Abstraction has 324 states and 398 transitions. [2020-09-04 16:12:13,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:12:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 398 transitions. [2020-09-04 16:12:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-09-04 16:12:13,383 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:13,383 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 16:12:13,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-04 16:12:13,384 INFO L427 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:13,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash 570378738, now seen corresponding path program 2 times [2020-09-04 16:12:13,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:13,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015871850] [2020-09-04 16:12:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:13,386 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 16:12:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-09-04 16:12:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 16:12:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:14,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015871850] [2020-09-04 16:12:14,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:14,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:12:14,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15716721] [2020-09-04 16:12:14,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:12:14,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:14,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:12:14,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:12:14,017 INFO L87 Difference]: Start difference. First operand 324 states and 398 transitions. Second operand 20 states. [2020-09-04 16:12:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:14,923 INFO L93 Difference]: Finished difference Result 604 states and 752 transitions. [2020-09-04 16:12:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:12:14,923 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 185 [2020-09-04 16:12:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:14,925 INFO L225 Difference]: With dead ends: 604 [2020-09-04 16:12:14,926 INFO L226 Difference]: Without dead ends: 408 [2020-09-04 16:12:14,927 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 16:12:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2020-09-04 16:12:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 324. [2020-09-04 16:12:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-09-04 16:12:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 398 transitions. [2020-09-04 16:12:14,981 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 398 transitions. Word has length 185 [2020-09-04 16:12:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:14,981 INFO L479 AbstractCegarLoop]: Abstraction has 324 states and 398 transitions. [2020-09-04 16:12:14,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:12:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 398 transitions. [2020-09-04 16:12:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-09-04 16:12:14,983 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:14,983 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 16:12:14,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-09-04 16:12:14,984 INFO L427 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash 922915896, now seen corresponding path program 3 times [2020-09-04 16:12:14,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:14,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821161446] [2020-09-04 16:12:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:14,986 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-09-04 16:12:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 16:12:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 16:12:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:15,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821161446] [2020-09-04 16:12:15,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:15,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:12:15,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847878465] [2020-09-04 16:12:15,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:12:15,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:12:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:12:15,442 INFO L87 Difference]: Start difference. First operand 324 states and 398 transitions. Second operand 21 states. [2020-09-04 16:12:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:15,896 INFO L93 Difference]: Finished difference Result 749 states and 903 transitions. [2020-09-04 16:12:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:12:15,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 190 [2020-09-04 16:12:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:15,899 INFO L225 Difference]: With dead ends: 749 [2020-09-04 16:12:15,899 INFO L226 Difference]: Without dead ends: 546 [2020-09-04 16:12:15,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:12:15,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-09-04 16:12:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 334. [2020-09-04 16:12:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-09-04 16:12:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 411 transitions. [2020-09-04 16:12:15,938 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 411 transitions. Word has length 190 [2020-09-04 16:12:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:15,938 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 411 transitions. [2020-09-04 16:12:15,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:12:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 411 transitions. [2020-09-04 16:12:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-09-04 16:12:15,940 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:15,940 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 16:12:15,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-04 16:12:15,941 INFO L427 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1087471382, now seen corresponding path program 3 times [2020-09-04 16:12:15,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:15,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099111559] [2020-09-04 16:12:15,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:15,943 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-09-04 16:12:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 16:12:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 16:12:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:16,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099111559] [2020-09-04 16:12:16,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:16,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:12:16,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215133861] [2020-09-04 16:12:16,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:12:16,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:16,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:12:16,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:12:16,608 INFO L87 Difference]: Start difference. First operand 334 states and 411 transitions. Second operand 21 states. [2020-09-04 16:12:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:17,604 INFO L93 Difference]: Finished difference Result 623 states and 777 transitions. [2020-09-04 16:12:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:12:17,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 190 [2020-09-04 16:12:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:17,607 INFO L225 Difference]: With dead ends: 623 [2020-09-04 16:12:17,607 INFO L226 Difference]: Without dead ends: 422 [2020-09-04 16:12:17,608 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:12:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-09-04 16:12:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 334. [2020-09-04 16:12:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-09-04 16:12:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 411 transitions. [2020-09-04 16:12:17,644 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 411 transitions. Word has length 190 [2020-09-04 16:12:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:17,645 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 411 transitions. [2020-09-04 16:12:17,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:12:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 411 transitions. [2020-09-04 16:12:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 16:12:17,646 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:17,647 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 16:12:17,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-04 16:12:17,647 INFO L427 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:17,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:17,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1276573760, now seen corresponding path program 4 times [2020-09-04 16:12:17,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:17,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [129554117] [2020-09-04 16:12:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:17,649 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:17,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:17,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:17,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 16:12:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 16:12:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 16:12:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:18,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [129554117] [2020-09-04 16:12:18,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:18,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:12:18,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267100894] [2020-09-04 16:12:18,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:12:18,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:18,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:12:18,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:12:18,192 INFO L87 Difference]: Start difference. First operand 334 states and 411 transitions. Second operand 22 states. [2020-09-04 16:12:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:18,705 INFO L93 Difference]: Finished difference Result 776 states and 936 transitions. [2020-09-04 16:12:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:12:18,705 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 195 [2020-09-04 16:12:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:18,709 INFO L225 Difference]: With dead ends: 776 [2020-09-04 16:12:18,709 INFO L226 Difference]: Without dead ends: 568 [2020-09-04 16:12:18,710 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 16:12:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-09-04 16:12:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 344. [2020-09-04 16:12:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-09-04 16:12:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 424 transitions. [2020-09-04 16:12:18,771 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 424 transitions. Word has length 195 [2020-09-04 16:12:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:18,771 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 424 transitions. [2020-09-04 16:12:18,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:12:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 424 transitions. [2020-09-04 16:12:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 16:12:18,773 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:18,775 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 16:12:18,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-09-04 16:12:18,775 INFO L427 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash -733813518, now seen corresponding path program 4 times [2020-09-04 16:12:18,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:18,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1530670174] [2020-09-04 16:12:18,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:18,780 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 16:12:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 16:12:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 16:12:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:19,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1530670174] [2020-09-04 16:12:19,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:19,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:12:19,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231848886] [2020-09-04 16:12:19,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:12:19,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:12:19,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:12:19,429 INFO L87 Difference]: Start difference. First operand 344 states and 424 transitions. Second operand 22 states. [2020-09-04 16:12:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:20,486 INFO L93 Difference]: Finished difference Result 642 states and 802 transitions. [2020-09-04 16:12:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:12:20,493 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 195 [2020-09-04 16:12:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:20,495 INFO L225 Difference]: With dead ends: 642 [2020-09-04 16:12:20,495 INFO L226 Difference]: Without dead ends: 436 [2020-09-04 16:12:20,497 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 16:12:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-09-04 16:12:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 344. [2020-09-04 16:12:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-09-04 16:12:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 424 transitions. [2020-09-04 16:12:20,534 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 424 transitions. Word has length 195 [2020-09-04 16:12:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:20,535 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 424 transitions. [2020-09-04 16:12:20,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:12:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 424 transitions. [2020-09-04 16:12:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 16:12:20,536 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:20,537 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 16:12:20,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-09-04 16:12:20,537 INFO L427 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash -171452104, now seen corresponding path program 5 times [2020-09-04 16:12:20,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:20,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791376810] [2020-09-04 16:12:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:20,539 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 16:12:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2020-09-04 16:12:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 16:12:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:21,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791376810] [2020-09-04 16:12:21,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:21,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:12:21,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023849412] [2020-09-04 16:12:21,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:12:21,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:21,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:12:21,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:12:21,145 INFO L87 Difference]: Start difference. First operand 344 states and 424 transitions. Second operand 23 states. [2020-09-04 16:12:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:21,670 INFO L93 Difference]: Finished difference Result 803 states and 969 transitions. [2020-09-04 16:12:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:12:21,671 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2020-09-04 16:12:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:21,674 INFO L225 Difference]: With dead ends: 803 [2020-09-04 16:12:21,674 INFO L226 Difference]: Without dead ends: 590 [2020-09-04 16:12:21,676 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 16:12:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-09-04 16:12:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 354. [2020-09-04 16:12:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-09-04 16:12:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2020-09-04 16:12:21,716 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 200 [2020-09-04 16:12:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:21,716 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2020-09-04 16:12:21,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:12:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2020-09-04 16:12:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 16:12:21,718 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:21,718 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 16:12:21,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-09-04 16:12:21,719 INFO L427 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2113127914, now seen corresponding path program 5 times [2020-09-04 16:12:21,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:21,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409308511] [2020-09-04 16:12:21,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:21,721 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 16:12:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2020-09-04 16:12:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 16:12:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:22,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409308511] [2020-09-04 16:12:22,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:22,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:12:22,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746549366] [2020-09-04 16:12:22,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:12:22,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:22,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:12:22,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:12:22,389 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand 23 states. [2020-09-04 16:12:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:23,602 INFO L93 Difference]: Finished difference Result 661 states and 827 transitions. [2020-09-04 16:12:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:12:23,603 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2020-09-04 16:12:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:23,605 INFO L225 Difference]: With dead ends: 661 [2020-09-04 16:12:23,605 INFO L226 Difference]: Without dead ends: 450 [2020-09-04 16:12:23,606 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 16:12:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-09-04 16:12:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 354. [2020-09-04 16:12:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-09-04 16:12:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2020-09-04 16:12:23,647 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 200 [2020-09-04 16:12:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:23,647 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2020-09-04 16:12:23,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:12:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2020-09-04 16:12:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-04 16:12:23,649 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:23,649 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 16:12:23,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-09-04 16:12:23,649 INFO L427 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1093348544, now seen corresponding path program 6 times [2020-09-04 16:12:23,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:23,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1001390103] [2020-09-04 16:12:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:23,652 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 16:12:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 16:12:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 16:12:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:24,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1001390103] [2020-09-04 16:12:24,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:24,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:12:24,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227870035] [2020-09-04 16:12:24,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:12:24,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:12:24,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:12:24,246 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand 24 states. [2020-09-04 16:12:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:24,727 INFO L93 Difference]: Finished difference Result 830 states and 1002 transitions. [2020-09-04 16:12:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 16:12:24,728 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 205 [2020-09-04 16:12:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:24,731 INFO L225 Difference]: With dead ends: 830 [2020-09-04 16:12:24,731 INFO L226 Difference]: Without dead ends: 612 [2020-09-04 16:12:24,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:12:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-09-04 16:12:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 364. [2020-09-04 16:12:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-09-04 16:12:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 450 transitions. [2020-09-04 16:12:24,788 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 450 transitions. Word has length 205 [2020-09-04 16:12:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:24,788 INFO L479 AbstractCegarLoop]: Abstraction has 364 states and 450 transitions. [2020-09-04 16:12:24,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:12:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 450 transitions. [2020-09-04 16:12:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-04 16:12:24,790 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:24,790 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 16:12:24,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-09-04 16:12:24,791 INFO L427 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1191231474, now seen corresponding path program 6 times [2020-09-04 16:12:24,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:24,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [392910187] [2020-09-04 16:12:24,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:24,793 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:25,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 16:12:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:25,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 16:12:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:25,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 16:12:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:25,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [392910187] [2020-09-04 16:12:25,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:25,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:12:25,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642443925] [2020-09-04 16:12:25,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:12:25,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:25,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:12:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:12:25,583 INFO L87 Difference]: Start difference. First operand 364 states and 450 transitions. Second operand 24 states. [2020-09-04 16:12:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:26,766 INFO L93 Difference]: Finished difference Result 680 states and 852 transitions. [2020-09-04 16:12:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 16:12:26,767 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 205 [2020-09-04 16:12:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:26,770 INFO L225 Difference]: With dead ends: 680 [2020-09-04 16:12:26,770 INFO L226 Difference]: Without dead ends: 464 [2020-09-04 16:12:26,771 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 16:12:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-09-04 16:12:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 364. [2020-09-04 16:12:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-09-04 16:12:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 450 transitions. [2020-09-04 16:12:26,813 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 450 transitions. Word has length 205 [2020-09-04 16:12:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:26,813 INFO L479 AbstractCegarLoop]: Abstraction has 364 states and 450 transitions. [2020-09-04 16:12:26,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:12:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 450 transitions. [2020-09-04 16:12:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 16:12:26,815 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:26,815 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 16:12:26,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-09-04 16:12:26,815 INFO L427 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:26,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:26,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1719328312, now seen corresponding path program 7 times [2020-09-04 16:12:26,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:26,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [20117214] [2020-09-04 16:12:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:26,818 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:26,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:26,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:26,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-09-04 16:12:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-09-04 16:12:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-09-04 16:12:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:27,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [20117214] [2020-09-04 16:12:27,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:27,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:12:27,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002418953] [2020-09-04 16:12:27,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:12:27,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:27,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:12:27,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:12:27,399 INFO L87 Difference]: Start difference. First operand 364 states and 450 transitions. Second operand 25 states. [2020-09-04 16:12:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:27,872 INFO L93 Difference]: Finished difference Result 857 states and 1035 transitions. [2020-09-04 16:12:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:12:27,873 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 210 [2020-09-04 16:12:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:27,876 INFO L225 Difference]: With dead ends: 857 [2020-09-04 16:12:27,876 INFO L226 Difference]: Without dead ends: 634 [2020-09-04 16:12:27,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:12:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-09-04 16:12:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 374. [2020-09-04 16:12:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-09-04 16:12:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 463 transitions. [2020-09-04 16:12:27,922 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 463 transitions. Word has length 210 [2020-09-04 16:12:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:27,922 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 463 transitions. [2020-09-04 16:12:27,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:12:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 463 transitions. [2020-09-04 16:12:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 16:12:27,924 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:27,924 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 16:12:27,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-09-04 16:12:27,925 INFO L427 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash -291058966, now seen corresponding path program 7 times [2020-09-04 16:12:27,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:27,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [555048676] [2020-09-04 16:12:27,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:27,927 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-09-04 16:12:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-09-04 16:12:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-09-04 16:12:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:28,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [555048676] [2020-09-04 16:12:28,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:28,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:12:28,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585065131] [2020-09-04 16:12:28,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:12:28,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:28,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:12:28,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:12:28,835 INFO L87 Difference]: Start difference. First operand 374 states and 463 transitions. Second operand 25 states. [2020-09-04 16:12:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:30,129 INFO L93 Difference]: Finished difference Result 699 states and 877 transitions. [2020-09-04 16:12:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:12:30,129 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 210 [2020-09-04 16:12:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:30,131 INFO L225 Difference]: With dead ends: 699 [2020-09-04 16:12:30,131 INFO L226 Difference]: Without dead ends: 478 [2020-09-04 16:12:30,132 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 16:12:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-09-04 16:12:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 374. [2020-09-04 16:12:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-09-04 16:12:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 463 transitions. [2020-09-04 16:12:30,173 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 463 transitions. Word has length 210 [2020-09-04 16:12:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:30,174 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 463 transitions. [2020-09-04 16:12:30,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:12:30,174 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 463 transitions. [2020-09-04 16:12:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-04 16:12:30,175 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:30,176 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 16:12:30,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-09-04 16:12:30,176 INFO L427 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1312616000, now seen corresponding path program 8 times [2020-09-04 16:12:30,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:30,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854604903] [2020-09-04 16:12:30,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:30,178 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 16:12:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 16:12:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2020-09-04 16:12:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:30,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854604903] [2020-09-04 16:12:30,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:30,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-09-04 16:12:30,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628206924] [2020-09-04 16:12:30,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 16:12:30,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 16:12:30,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:12:30,876 INFO L87 Difference]: Start difference. First operand 374 states and 463 transitions. Second operand 26 states. [2020-09-04 16:12:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:31,423 INFO L93 Difference]: Finished difference Result 884 states and 1068 transitions. [2020-09-04 16:12:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:12:31,423 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2020-09-04 16:12:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:31,427 INFO L225 Difference]: With dead ends: 884 [2020-09-04 16:12:31,427 INFO L226 Difference]: Without dead ends: 656 [2020-09-04 16:12:31,428 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 16:12:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-09-04 16:12:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 384. [2020-09-04 16:12:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-09-04 16:12:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2020-09-04 16:12:31,472 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 215 [2020-09-04 16:12:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:31,473 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2020-09-04 16:12:31,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 16:12:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2020-09-04 16:12:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-04 16:12:31,475 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:31,475 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 16:12:31,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-09-04 16:12:31,475 INFO L427 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:31,476 INFO L82 PathProgramCache]: Analyzing trace with hash -697771278, now seen corresponding path program 8 times [2020-09-04 16:12:31,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:31,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523662443] [2020-09-04 16:12:31,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:31,478 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:31,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:31,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:31,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:32,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 16:12:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:32,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 16:12:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:32,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2020-09-04 16:12:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:32,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523662443] [2020-09-04 16:12:32,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:32,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-09-04 16:12:32,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789693203] [2020-09-04 16:12:32,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 16:12:32,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:32,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 16:12:32,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:12:32,342 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand 26 states. [2020-09-04 16:12:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:33,948 INFO L93 Difference]: Finished difference Result 718 states and 902 transitions. [2020-09-04 16:12:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:12:33,949 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2020-09-04 16:12:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:33,950 INFO L225 Difference]: With dead ends: 718 [2020-09-04 16:12:33,951 INFO L226 Difference]: Without dead ends: 492 [2020-09-04 16:12:33,951 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 16:12:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-09-04 16:12:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 384. [2020-09-04 16:12:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-09-04 16:12:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2020-09-04 16:12:33,992 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 215 [2020-09-04 16:12:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:33,993 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2020-09-04 16:12:33,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 16:12:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2020-09-04 16:12:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-04 16:12:33,994 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:33,995 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 16:12:33,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-09-04 16:12:33,995 INFO L427 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1256956728, now seen corresponding path program 9 times [2020-09-04 16:12:33,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:33,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1777664739] [2020-09-04 16:12:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:33,997 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-09-04 16:12:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 16:12:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-09-04 16:12:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:34,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1777664739] [2020-09-04 16:12:34,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:34,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 16:12:34,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721334047] [2020-09-04 16:12:34,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 16:12:34,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:34,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 16:12:34,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:12:34,708 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand 27 states. [2020-09-04 16:12:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:35,354 INFO L93 Difference]: Finished difference Result 911 states and 1101 transitions. [2020-09-04 16:12:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 16:12:35,355 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2020-09-04 16:12:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:35,358 INFO L225 Difference]: With dead ends: 911 [2020-09-04 16:12:35,358 INFO L226 Difference]: Without dead ends: 678 [2020-09-04 16:12:35,359 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 16:12:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-09-04 16:12:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 394. [2020-09-04 16:12:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-09-04 16:12:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2020-09-04 16:12:35,400 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 220 [2020-09-04 16:12:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:35,401 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2020-09-04 16:12:35,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 16:12:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2020-09-04 16:12:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-04 16:12:35,402 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:35,402 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 16:12:35,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-09-04 16:12:35,403 INFO L427 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:35,403 INFO L82 PathProgramCache]: Analyzing trace with hash -753430550, now seen corresponding path program 9 times [2020-09-04 16:12:35,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:35,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776761266] [2020-09-04 16:12:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:35,405 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:35,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:35,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:35,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:36,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-09-04 16:12:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:36,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 16:12:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:36,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-09-04 16:12:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:36,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776761266] [2020-09-04 16:12:36,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:36,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 16:12:36,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808330077] [2020-09-04 16:12:36,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 16:12:36,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:36,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 16:12:36,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:12:36,382 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 27 states. [2020-09-04 16:12:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:38,125 INFO L93 Difference]: Finished difference Result 737 states and 927 transitions. [2020-09-04 16:12:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 16:12:38,126 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2020-09-04 16:12:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:38,128 INFO L225 Difference]: With dead ends: 737 [2020-09-04 16:12:38,128 INFO L226 Difference]: Without dead ends: 506 [2020-09-04 16:12:38,129 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 16:12:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-09-04 16:12:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 394. [2020-09-04 16:12:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-09-04 16:12:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2020-09-04 16:12:38,172 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 220 [2020-09-04 16:12:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:38,172 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2020-09-04 16:12:38,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 16:12:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2020-09-04 16:12:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 16:12:38,174 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:38,174 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 16:12:38,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-09-04 16:12:38,174 INFO L427 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash -629192384, now seen corresponding path program 10 times [2020-09-04 16:12:38,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:38,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1428270475] [2020-09-04 16:12:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:38,176 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:38,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1428270475] [2020-09-04 16:12:38,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:38,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-09-04 16:12:38,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577060355] [2020-09-04 16:12:38,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 16:12:38,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:38,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 16:12:38,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:12:38,998 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 28 states. [2020-09-04 16:12:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:39,666 INFO L93 Difference]: Finished difference Result 938 states and 1134 transitions. [2020-09-04 16:12:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 16:12:39,666 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-09-04 16:12:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:39,670 INFO L225 Difference]: With dead ends: 938 [2020-09-04 16:12:39,670 INFO L226 Difference]: Without dead ends: 700 [2020-09-04 16:12:39,671 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 16:12:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-09-04 16:12:39,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 404. [2020-09-04 16:12:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-09-04 16:12:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 502 transitions. [2020-09-04 16:12:39,716 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 502 transitions. Word has length 225 [2020-09-04 16:12:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:39,716 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 502 transitions. [2020-09-04 16:12:39,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 16:12:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 502 transitions. [2020-09-04 16:12:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 16:12:39,718 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:39,718 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 16:12:39,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-09-04 16:12:39,718 INFO L427 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1655387634, now seen corresponding path program 10 times [2020-09-04 16:12:39,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:39,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [295065088] [2020-09-04 16:12:39,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:39,721 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:39,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:39,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:39,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:39,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:39,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:39,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:40,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [295065088] [2020-09-04 16:12:40,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:40,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:12:40,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067959302] [2020-09-04 16:12:40,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:12:40,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:40,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:12:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:12:40,057 INFO L87 Difference]: Start difference. First operand 404 states and 502 transitions. Second operand 10 states. [2020-09-04 16:12:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:40,394 INFO L93 Difference]: Finished difference Result 459 states and 581 transitions. [2020-09-04 16:12:40,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:40,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 225 [2020-09-04 16:12:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:40,398 INFO L225 Difference]: With dead ends: 459 [2020-09-04 16:12:40,398 INFO L226 Difference]: Without dead ends: 453 [2020-09-04 16:12:40,399 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 16:12:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2020-09-04 16:12:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 430. [2020-09-04 16:12:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-09-04 16:12:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 540 transitions. [2020-09-04 16:12:40,480 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 540 transitions. Word has length 225 [2020-09-04 16:12:40,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:40,483 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 540 transitions. [2020-09-04 16:12:40,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:12:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 540 transitions. [2020-09-04 16:12:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-04 16:12:40,486 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:40,486 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 16:12:40,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-09-04 16:12:40,486 INFO L427 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:40,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:40,487 INFO L82 PathProgramCache]: Analyzing trace with hash -131719239, now seen corresponding path program 1 times [2020-09-04 16:12:40,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:40,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1937580030] [2020-09-04 16:12:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:40,489 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:40,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1937580030] [2020-09-04 16:12:40,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:40,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:12:40,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796093720] [2020-09-04 16:12:40,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:12:40,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:12:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:12:40,844 INFO L87 Difference]: Start difference. First operand 430 states and 540 transitions. Second operand 12 states. [2020-09-04 16:12:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:41,209 INFO L93 Difference]: Finished difference Result 459 states and 579 transitions. [2020-09-04 16:12:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:41,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 227 [2020-09-04 16:12:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:41,212 INFO L225 Difference]: With dead ends: 459 [2020-09-04 16:12:41,212 INFO L226 Difference]: Without dead ends: 452 [2020-09-04 16:12:41,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:12:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-09-04 16:12:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2020-09-04 16:12:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-09-04 16:12:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 549 transitions. [2020-09-04 16:12:41,252 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 549 transitions. Word has length 227 [2020-09-04 16:12:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:41,252 INFO L479 AbstractCegarLoop]: Abstraction has 438 states and 549 transitions. [2020-09-04 16:12:41,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:12:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 549 transitions. [2020-09-04 16:12:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-04 16:12:41,254 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:41,254 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 16:12:41,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-09-04 16:12:41,254 INFO L427 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:41,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:41,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1678288039, now seen corresponding path program 1 times [2020-09-04 16:12:41,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:41,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1517012596] [2020-09-04 16:12:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:41,256 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 16:12:41,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1517012596] [2020-09-04 16:12:41,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:41,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:12:41,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531878907] [2020-09-04 16:12:41,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:12:41,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:41,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:12:41,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:12:41,420 INFO L87 Difference]: Start difference. First operand 438 states and 549 transitions. Second operand 6 states. [2020-09-04 16:12:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:41,516 INFO L93 Difference]: Finished difference Result 444 states and 554 transitions. [2020-09-04 16:12:41,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:12:41,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2020-09-04 16:12:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:41,519 INFO L225 Difference]: With dead ends: 444 [2020-09-04 16:12:41,519 INFO L226 Difference]: Without dead ends: 432 [2020-09-04 16:12:41,519 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 16:12:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-09-04 16:12:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-09-04 16:12:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-09-04 16:12:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 541 transitions. [2020-09-04 16:12:41,586 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 541 transitions. Word has length 227 [2020-09-04 16:12:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:41,587 INFO L479 AbstractCegarLoop]: Abstraction has 432 states and 541 transitions. [2020-09-04 16:12:41,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:12:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 541 transitions. [2020-09-04 16:12:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-09-04 16:12:41,589 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:41,590 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 16:12:41,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-09-04 16:12:41,590 INFO L427 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 947853182, now seen corresponding path program 1 times [2020-09-04 16:12:41,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:41,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [650615412] [2020-09-04 16:12:41,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:41,593 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-09-04 16:12:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 16:12:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 16:12:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:41,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [650615412] [2020-09-04 16:12:41,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:41,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:12:41,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922125477] [2020-09-04 16:12:41,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:12:41,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:41,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:12:41,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:12:41,809 INFO L87 Difference]: Start difference. First operand 432 states and 541 transitions. Second operand 5 states. [2020-09-04 16:12:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:41,964 INFO L93 Difference]: Finished difference Result 691 states and 868 transitions. [2020-09-04 16:12:41,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:12:41,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2020-09-04 16:12:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:41,968 INFO L225 Difference]: With dead ends: 691 [2020-09-04 16:12:41,968 INFO L226 Difference]: Without dead ends: 280 [2020-09-04 16:12:41,971 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 16:12:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-09-04 16:12:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2020-09-04 16:12:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-09-04 16:12:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 327 transitions. [2020-09-04 16:12:42,011 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 327 transitions. Word has length 230 [2020-09-04 16:12:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:42,011 INFO L479 AbstractCegarLoop]: Abstraction has 263 states and 327 transitions. [2020-09-04 16:12:42,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:12:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 327 transitions. [2020-09-04 16:12:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-09-04 16:12:42,014 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:42,014 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 16:12:42,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-09-04 16:12:42,014 INFO L427 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash -671277925, now seen corresponding path program 1 times [2020-09-04 16:12:42,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:42,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1855288936] [2020-09-04 16:12:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:42,017 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 16:12:42,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1855288936] [2020-09-04 16:12:42,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:42,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:12:42,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775944077] [2020-09-04 16:12:42,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:12:42,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:42,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:12:42,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:12:42,271 INFO L87 Difference]: Start difference. First operand 263 states and 327 transitions. Second operand 8 states. [2020-09-04 16:12:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:42,408 INFO L93 Difference]: Finished difference Result 317 states and 389 transitions. [2020-09-04 16:12:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:12:42,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2020-09-04 16:12:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:42,411 INFO L225 Difference]: With dead ends: 317 [2020-09-04 16:12:42,411 INFO L226 Difference]: Without dead ends: 298 [2020-09-04 16:12:42,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:12:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-09-04 16:12:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 269. [2020-09-04 16:12:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-09-04 16:12:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2020-09-04 16:12:42,462 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 236 [2020-09-04 16:12:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:42,463 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2020-09-04 16:12:42,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:12:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2020-09-04 16:12:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-09-04 16:12:42,466 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:42,467 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 16:12:42,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-09-04 16:12:42,467 INFO L427 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash 287100319, now seen corresponding path program 1 times [2020-09-04 16:12:42,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:42,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1953577233] [2020-09-04 16:12:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:42,470 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-09-04 16:12:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:12:42,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1953577233] [2020-09-04 16:12:42,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:42,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:12:42,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474993786] [2020-09-04 16:12:42,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:12:42,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:42,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:12:42,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:12:42,979 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 13 states. [2020-09-04 16:12:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:43,349 INFO L93 Difference]: Finished difference Result 346 states and 421 transitions. [2020-09-04 16:12:43,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:12:43,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2020-09-04 16:12:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:43,352 INFO L225 Difference]: With dead ends: 346 [2020-09-04 16:12:43,352 INFO L226 Difference]: Without dead ends: 334 [2020-09-04 16:12:43,352 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:12:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-09-04 16:12:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 308. [2020-09-04 16:12:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-09-04 16:12:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 379 transitions. [2020-09-04 16:12:43,415 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 379 transitions. Word has length 240 [2020-09-04 16:12:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:43,417 INFO L479 AbstractCegarLoop]: Abstraction has 308 states and 379 transitions. [2020-09-04 16:12:43,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:12:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 379 transitions. [2020-09-04 16:12:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-09-04 16:12:43,419 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:43,419 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, 1, 1, 1] [2020-09-04 16:12:43,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-09-04 16:12:43,420 INFO L427 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:43,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1150729662, now seen corresponding path program 1 times [2020-09-04 16:12:43,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:43,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1904687648] [2020-09-04 16:12:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:43,424 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-09-04 16:12:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:12:43,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1904687648] [2020-09-04 16:12:43,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:43,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:12:43,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011065680] [2020-09-04 16:12:43,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:12:43,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:43,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:12:43,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:12:43,717 INFO L87 Difference]: Start difference. First operand 308 states and 379 transitions. Second operand 10 states. [2020-09-04 16:12:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:44,001 INFO L93 Difference]: Finished difference Result 320 states and 390 transitions. [2020-09-04 16:12:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:44,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 243 [2020-09-04 16:12:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:44,004 INFO L225 Difference]: With dead ends: 320 [2020-09-04 16:12:44,004 INFO L226 Difference]: Without dead ends: 294 [2020-09-04 16:12:44,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-09-04 16:12:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 265. [2020-09-04 16:12:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-09-04 16:12:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 302 transitions. [2020-09-04 16:12:44,049 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 302 transitions. Word has length 243 [2020-09-04 16:12:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:44,050 INFO L479 AbstractCegarLoop]: Abstraction has 265 states and 302 transitions. [2020-09-04 16:12:44,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:12:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 302 transitions. [2020-09-04 16:12:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-09-04 16:12:44,052 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:44,052 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] [2020-09-04 16:12:44,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-09-04 16:12:44,052 INFO L427 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash 661117091, now seen corresponding path program 2 times [2020-09-04 16:12:44,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:44,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416850323] [2020-09-04 16:12:44,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:44,055 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-09-04 16:12:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-09-04 16:12:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-04 16:12:44,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416850323] [2020-09-04 16:12:44,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:44,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:12:44,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793640756] [2020-09-04 16:12:44,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:12:44,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:44,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:12:44,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:12:44,430 INFO L87 Difference]: Start difference. First operand 265 states and 302 transitions. Second operand 11 states. [2020-09-04 16:12:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:44,730 INFO L93 Difference]: Finished difference Result 333 states and 378 transitions. [2020-09-04 16:12:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:44,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 244 [2020-09-04 16:12:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:44,733 INFO L225 Difference]: With dead ends: 333 [2020-09-04 16:12:44,733 INFO L226 Difference]: Without dead ends: 268 [2020-09-04 16:12:44,733 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 16:12:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-09-04 16:12:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2020-09-04 16:12:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-09-04 16:12:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 305 transitions. [2020-09-04 16:12:44,790 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 305 transitions. Word has length 244 [2020-09-04 16:12:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:44,790 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 305 transitions. [2020-09-04 16:12:44,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:12:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 305 transitions. [2020-09-04 16:12:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-09-04 16:12:44,792 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:44,792 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 16:12:44,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-09-04 16:12:44,792 INFO L427 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:44,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:44,793 INFO L82 PathProgramCache]: Analyzing trace with hash -229943887, now seen corresponding path program 1 times [2020-09-04 16:12:44,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:44,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [60202061] [2020-09-04 16:12:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:44,795 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 16:12:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-09-04 16:12:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 16:12:45,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [60202061] [2020-09-04 16:12:45,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:45,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:12:45,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879734338] [2020-09-04 16:12:45,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:12:45,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:45,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:12:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:12:45,310 INFO L87 Difference]: Start difference. First operand 268 states and 305 transitions. Second operand 14 states. [2020-09-04 16:12:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:45,776 INFO L93 Difference]: Finished difference Result 324 states and 366 transitions. [2020-09-04 16:12:45,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:12:45,777 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 245 [2020-09-04 16:12:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:45,779 INFO L225 Difference]: With dead ends: 324 [2020-09-04 16:12:45,779 INFO L226 Difference]: Without dead ends: 312 [2020-09-04 16:12:45,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:12:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-09-04 16:12:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2020-09-04 16:12:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-09-04 16:12:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 346 transitions. [2020-09-04 16:12:45,838 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 346 transitions. Word has length 245 [2020-09-04 16:12:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:45,840 INFO L479 AbstractCegarLoop]: Abstraction has 304 states and 346 transitions. [2020-09-04 16:12:45,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:12:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 346 transitions. [2020-09-04 16:12:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-09-04 16:12:45,842 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:45,842 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 16:12:45,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-09-04 16:12:45,842 INFO L427 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash 818281555, now seen corresponding path program 1 times [2020-09-04 16:12:45,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:45,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956640791] [2020-09-04 16:12:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:45,845 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 16:12:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2020-09-04 16:12:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 16:12:46,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956640791] [2020-09-04 16:12:46,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:46,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:12:46,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112223910] [2020-09-04 16:12:46,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:12:46,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:46,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:12:46,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:12:46,402 INFO L87 Difference]: Start difference. First operand 304 states and 346 transitions. Second operand 11 states. [2020-09-04 16:12:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:46,704 INFO L93 Difference]: Finished difference Result 316 states and 357 transitions. [2020-09-04 16:12:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:12:46,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 246 [2020-09-04 16:12:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:46,707 INFO L225 Difference]: With dead ends: 316 [2020-09-04 16:12:46,707 INFO L226 Difference]: Without dead ends: 275 [2020-09-04 16:12:46,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:46,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-09-04 16:12:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2020-09-04 16:12:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-09-04 16:12:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 304 transitions. [2020-09-04 16:12:46,764 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 304 transitions. Word has length 246 [2020-09-04 16:12:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:46,765 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 304 transitions. [2020-09-04 16:12:46,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:12:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 304 transitions. [2020-09-04 16:12:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-09-04 16:12:46,766 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:46,767 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, 1, 1, 1] [2020-09-04 16:12:46,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-09-04 16:12:46,767 INFO L427 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:46,767 INFO L82 PathProgramCache]: Analyzing trace with hash -360487828, now seen corresponding path program 1 times [2020-09-04 16:12:46,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:46,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1271051046] [2020-09-04 16:12:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:46,769 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 16:12:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-09-04 16:12:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 16:12:47,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1271051046] [2020-09-04 16:12:47,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:47,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:12:47,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803104464] [2020-09-04 16:12:47,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:12:47,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:12:47,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:12:47,232 INFO L87 Difference]: Start difference. First operand 268 states and 304 transitions. Second operand 12 states. [2020-09-04 16:12:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:47,634 INFO L93 Difference]: Finished difference Result 268 states and 304 transitions. [2020-09-04 16:12:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:12:47,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 248 [2020-09-04 16:12:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:47,636 INFO L225 Difference]: With dead ends: 268 [2020-09-04 16:12:47,636 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:12:47,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:12:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:12:47,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:12:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:12:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:12:47,639 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2020-09-04 16:12:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:47,639 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:12:47,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:12:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:12:47,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:12:47,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-09-04 16:12:47,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:12:49,518 WARN L193 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 16:12:56,650 WARN L193 SmtUtils]: Spent 7.13 s on a formula simplification. DAG size of input: 492 DAG size of output: 4 [2020-09-04 16:13:07,244 WARN L193 SmtUtils]: Spent 10.58 s on a formula simplification. DAG size of input: 561 DAG size of output: 4 [2020-09-04 16:13:09,014 WARN L193 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 282 DAG size of output: 4 [2020-09-04 16:13:10,121 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 231 DAG size of output: 4 [2020-09-04 16:13:10,422 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 4 [2020-09-04 16:13:15,256 WARN L193 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 427 DAG size of output: 4 [2020-09-04 16:13:18,097 WARN L193 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 337 DAG size of output: 4 [2020-09-04 16:13:26,688 WARN L193 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 526 DAG size of output: 4 [2020-09-04 16:13:27,320 WARN L193 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 4 [2020-09-04 16:13:27,467 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 4 [2020-09-04 16:13:37,996 WARN L193 SmtUtils]: Spent 10.53 s on a formula simplification. DAG size of input: 592 DAG size of output: 4 [2020-09-04 16:13:39,356 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 16:13:45,183 WARN L193 SmtUtils]: Spent 5.80 s on a formula simplification. DAG size of input: 459 DAG size of output: 4 [2020-09-04 16:13:47,362 WARN L193 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 309 DAG size of output: 4 [2020-09-04 16:13:48,759 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 256 DAG size of output: 4 [2020-09-04 16:13:49,578 WARN L193 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 4 [2020-09-04 16:14:00,037 WARN L193 SmtUtils]: Spent 10.45 s on a formula simplification. DAG size of input: 592 DAG size of output: 4 [2020-09-04 16:14:01,528 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 586 DAG size of output: 137 [2020-09-04 16:14:01,869 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 4 [2020-09-04 16:14:05,922 WARN L193 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 396 DAG size of output: 4 [2020-09-04 16:14:09,165 WARN L193 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 366 DAG size of output: 4 [2020-09-04 16:14:09,623 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 4 [2020-09-04 16:14:21,217 WARN L193 SmtUtils]: Spent 11.59 s on a formula simplification. DAG size of input: 601 DAG size of output: 8 [2020-09-04 16:14:22,566 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 16:14:23,912 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 16:14:25,384 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 16:14:34,284 WARN L193 SmtUtils]: Spent 8.90 s on a formula simplification. DAG size of input: 499 DAG size of output: 4 [2020-09-04 16:14:46,935 WARN L193 SmtUtils]: Spent 12.65 s on a formula simplification. DAG size of input: 568 DAG size of output: 4 [2020-09-04 16:14:49,190 WARN L193 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 289 DAG size of output: 4 [2020-09-04 16:14:50,572 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 238 DAG size of output: 4 [2020-09-04 16:14:50,878 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 4 [2020-09-04 16:14:57,389 WARN L193 SmtUtils]: Spent 6.51 s on a formula simplification. DAG size of input: 434 DAG size of output: 4 [2020-09-04 16:15:00,864 WARN L193 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 344 DAG size of output: 4 [2020-09-04 16:15:11,707 WARN L193 SmtUtils]: Spent 10.84 s on a formula simplification. DAG size of input: 533 DAG size of output: 4 [2020-09-04 16:15:12,484 WARN L193 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 4 [2020-09-04 16:15:12,650 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 4 [2020-09-04 16:15:28,319 WARN L193 SmtUtils]: Spent 15.67 s on a formula simplification. DAG size of input: 571 DAG size of output: 4 [2020-09-04 16:15:29,454 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 16:15:37,091 WARN L193 SmtUtils]: Spent 7.62 s on a formula simplification. DAG size of input: 466 DAG size of output: 4 [2020-09-04 16:15:39,905 WARN L193 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 316 DAG size of output: 4 [2020-09-04 16:15:41,655 WARN L193 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 263 DAG size of output: 4 [2020-09-04 16:15:42,651 WARN L193 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 4 [2020-09-04 16:15:58,434 WARN L193 SmtUtils]: Spent 15.78 s on a formula simplification. DAG size of input: 571 DAG size of output: 4 [2020-09-04 16:15:58,812 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 4 [2020-09-04 16:16:04,223 WARN L193 SmtUtils]: Spent 5.41 s on a formula simplification. DAG size of input: 403 DAG size of output: 4 [2020-09-04 16:16:08,503 WARN L193 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 373 DAG size of output: 4 [2020-09-04 16:16:09,034 WARN L193 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 4 [2020-09-04 16:16:24,570 WARN L193 SmtUtils]: Spent 15.53 s on a formula simplification. DAG size of input: 578 DAG size of output: 8 [2020-09-04 16:16:25,754 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 16:16:26,895 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 16:16:28,249 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:16:29,174 WARN L193 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 4 [2020-09-04 16:16:30,298 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 161 DAG size of output: 4 [2020-09-04 16:16:30,718 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 4 [2020-09-04 16:16:31,031 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 4 [2020-09-04 16:16:31,203 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 4 [2020-09-04 16:16:32,017 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 4 [2020-09-04 16:16:32,550 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 4 [2020-09-04 16:16:33,574 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 155 DAG size of output: 4 [2020-09-04 16:16:33,798 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 4 [2020-09-04 16:16:35,048 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 164 DAG size of output: 4 [2020-09-04 16:16:35,782 WARN L193 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:16:36,673 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 4 [2020-09-04 16:16:37,144 WARN L193 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 4 [2020-09-04 16:16:37,512 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 4 [2020-09-04 16:16:37,822 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 4 [2020-09-04 16:16:38,986 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 164 DAG size of output: 4 [2020-09-04 16:16:39,729 WARN L193 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:16:39,878 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 4 [2020-09-04 16:16:40,574 WARN L193 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 4 [2020-09-04 16:16:41,183 WARN L193 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 4 [2020-09-04 16:16:41,372 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 4 [2020-09-04 16:16:42,580 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 171 DAG size of output: 4 [2020-09-04 16:16:43,331 WARN L193 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:16:44,072 WARN L193 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:16:44,735 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:16:44,978 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 4 [2020-09-04 16:16:45,265 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 4 [2020-09-04 16:16:45,379 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 4 [2020-09-04 16:16:45,727 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 4 [2020-09-04 16:16:45,877 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 4 [2020-09-04 16:16:46,142 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 4 [2020-09-04 16:16:46,539 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 4 [2020-09-04 16:16:46,758 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:16:46,993 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 4 [2020-09-04 16:16:47,123 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 4 [2020-09-04 16:16:47,599 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 4 [2020-09-04 16:16:47,819 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:16:48,048 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 4 [2020-09-04 16:16:48,210 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 4 [2020-09-04 16:16:48,572 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 4 [2020-09-04 16:16:48,806 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:16:49,028 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:17:45,906 WARN L193 SmtUtils]: Spent 56.44 s on a formula simplification. DAG size of input: 1153 DAG size of output: 991 [2020-09-04 16:18:44,156 WARN L193 SmtUtils]: Spent 58.24 s on a formula simplification. DAG size of input: 957 DAG size of output: 9 [2020-09-04 16:20:11,952 WARN L193 SmtUtils]: Spent 1.46 m on a formula simplification. DAG size of input: 1093 DAG size of output: 9 [2020-09-04 16:20:23,847 WARN L193 SmtUtils]: Spent 11.89 s on a formula simplification. DAG size of input: 545 DAG size of output: 9 [2020-09-04 16:20:30,782 WARN L193 SmtUtils]: Spent 6.93 s on a formula simplification. DAG size of input: 445 DAG size of output: 9 [2020-09-04 16:20:31,013 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 9 [2020-09-04 16:20:32,128 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 231 DAG size of output: 9 [2020-09-04 16:21:10,026 WARN L193 SmtUtils]: Spent 37.88 s on a formula simplification. DAG size of input: 829 DAG size of output: 9 [2020-09-04 16:21:29,907 WARN L193 SmtUtils]: Spent 19.88 s on a formula simplification. DAG size of input: 653 DAG size of output: 9 [2020-09-04 16:22:40,818 WARN L193 SmtUtils]: Spent 1.18 m on a formula simplification. DAG size of input: 1024 DAG size of output: 9 [2020-09-04 16:22:44,448 WARN L193 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 353 DAG size of output: 9 [2020-09-04 16:22:45,153 WARN L193 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 9 [2020-09-04 16:24:23,293 WARN L193 SmtUtils]: Spent 1.64 m on a formula simplification. DAG size of input: 1135 DAG size of output: 9 [2020-09-04 16:25:19,989 WARN L193 SmtUtils]: Spent 56.69 s on a formula simplification. DAG size of input: 1153 DAG size of output: 991