/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 04:47:43,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 04:47:43,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 04:47:43,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 04:47:43,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 04:47:43,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 04:47:43,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 04:47:43,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 04:47:43,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 04:47:43,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 04:47:43,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 04:47:43,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 04:47:43,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 04:47:43,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 04:47:43,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 04:47:43,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 04:47:43,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 04:47:43,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 04:47:43,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 04:47:43,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 04:47:43,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 04:47:43,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 04:47:43,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 04:47:43,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 04:47:43,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 04:47:43,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 04:47:43,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 04:47:43,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 04:47:43,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 04:47:43,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 04:47:43,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 04:47:43,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 04:47:43,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 04:47:43,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 04:47:43,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 04:47:43,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 04:47:43,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 04:47:43,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 04:47:43,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 04:47:43,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 04:47:43,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 04:47:43,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 04:47:43,611 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 04:47:43,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 04:47:43,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 04:47:43,615 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 04:47:43,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 04:47:43,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 04:47:43,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 04:47:43,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 04:47:43,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 04:47:43,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 04:47:43,618 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 04:47:43,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 04:47:43,618 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 04:47:43,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 04:47:43,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 04:47:43,619 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 04:47:43,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 04:47:43,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 04:47:43,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:47:43,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 04:47:43,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 04:47:43,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 04:47:43,621 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 04:47:43,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 04:47:44,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 04:47:44,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 04:47:44,009 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 04:47:44,010 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 04:47:44,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2020-11-07 04:47:44,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65816d0a6/71194df986514c2e806c192d46e568fc/FLAGc2b5699ba [2020-11-07 04:47:44,760 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 04:47:44,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2020-11-07 04:47:44,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65816d0a6/71194df986514c2e806c192d46e568fc/FLAGc2b5699ba [2020-11-07 04:47:45,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65816d0a6/71194df986514c2e806c192d46e568fc [2020-11-07 04:47:45,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 04:47:45,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 04:47:45,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 04:47:45,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 04:47:45,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 04:47:45,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:47:45" (1/1) ... [2020-11-07 04:47:45,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4548f804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45, skipping insertion in model container [2020-11-07 04:47:45,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:47:45" (1/1) ... [2020-11-07 04:47:45,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 04:47:45,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 04:47:45,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:47:45,405 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 04:47:45,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:47:45,472 INFO L208 MainTranslator]: Completed translation [2020-11-07 04:47:45,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45 WrapperNode [2020-11-07 04:47:45,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 04:47:45,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 04:47:45,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 04:47:45,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 04:47:45,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45" (1/1) ... [2020-11-07 04:47:45,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45" (1/1) ... [2020-11-07 04:47:45,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45" (1/1) ... [2020-11-07 04:47:45,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45" (1/1) ... [2020-11-07 04:47:45,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45" (1/1) ... [2020-11-07 04:47:45,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45" (1/1) ... [2020-11-07 04:47:45,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45" (1/1) ... [2020-11-07 04:47:45,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 04:47:45,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 04:47:45,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 04:47:45,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 04:47:45,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:47:45,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 04:47:45,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 04:47:45,646 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 04:47:45,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 04:47:45,646 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2020-11-07 04:47:45,647 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2020-11-07 04:47:45,647 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2020-11-07 04:47:45,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 04:47:45,647 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 04:47:45,647 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 04:47:45,647 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 04:47:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 04:47:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-07 04:47:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 04:47:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 04:47:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2020-11-07 04:47:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2020-11-07 04:47:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2020-11-07 04:47:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 04:47:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 04:47:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 04:47:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 04:47:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 04:47:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 04:47:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 04:47:46,329 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 04:47:46,329 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 04:47:46,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:47:46 BoogieIcfgContainer [2020-11-07 04:47:46,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 04:47:46,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 04:47:46,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 04:47:46,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 04:47:46,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:47:45" (1/3) ... [2020-11-07 04:47:46,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a55b2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:47:46, skipping insertion in model container [2020-11-07 04:47:46,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:45" (2/3) ... [2020-11-07 04:47:46,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a55b2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:47:46, skipping insertion in model container [2020-11-07 04:47:46,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:47:46" (3/3) ... [2020-11-07 04:47:46,341 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2020-11-07 04:47:46,356 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 04:47:46,359 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 04:47:46,371 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 04:47:46,394 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 04:47:46,395 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 04:47:46,395 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 04:47:46,395 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 04:47:46,395 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 04:47:46,395 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 04:47:46,395 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 04:47:46,395 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 04:47:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-11-07 04:47:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-07 04:47:46,431 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:46,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:46,432 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:46,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash -415784909, now seen corresponding path program 1 times [2020-11-07 04:47:46,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:46,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945362243] [2020-11-07 04:47:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:46,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:46,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:46,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:46,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 04:47:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:46,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-11-07 04:47:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:46,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 04:47:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-11-07 04:47:46,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945362243] [2020-11-07 04:47:46,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:47:46,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 04:47:46,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637503219] [2020-11-07 04:47:46,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 04:47:46,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 04:47:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 04:47:46,854 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 4 states. [2020-11-07 04:47:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:47,512 INFO L93 Difference]: Finished difference Result 266 states and 323 transitions. [2020-11-07 04:47:47,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 04:47:47,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2020-11-07 04:47:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:47,527 INFO L225 Difference]: With dead ends: 266 [2020-11-07 04:47:47,527 INFO L226 Difference]: Without dead ends: 135 [2020-11-07 04:47:47,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-11-07 04:47:47,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-07 04:47:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-11-07 04:47:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 04:47:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2020-11-07 04:47:47,609 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 109 [2020-11-07 04:47:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:47,611 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2020-11-07 04:47:47,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 04:47:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2020-11-07 04:47:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-07 04:47:47,617 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:47,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:47,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 04:47:47,618 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2075471796, now seen corresponding path program 1 times [2020-11-07 04:47:47,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:47,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [792215545] [2020-11-07 04:47:47,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:47,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:47,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:47,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:47,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 04:47:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:47,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-11-07 04:47:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:47,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 04:47:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-11-07 04:47:47,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [792215545] [2020-11-07 04:47:47,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:47:47,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-07 04:47:47,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034798047] [2020-11-07 04:47:47,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 04:47:47,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:47,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 04:47:47,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 04:47:47,793 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 5 states. [2020-11-07 04:47:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:48,251 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2020-11-07 04:47:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 04:47:48,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2020-11-07 04:47:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:48,255 INFO L225 Difference]: With dead ends: 152 [2020-11-07 04:47:48,255 INFO L226 Difference]: Without dead ends: 134 [2020-11-07 04:47:48,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:47:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-07 04:47:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-11-07 04:47:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 04:47:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2020-11-07 04:47:48,285 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 111 [2020-11-07 04:47:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:48,286 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2020-11-07 04:47:48,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 04:47:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2020-11-07 04:47:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-07 04:47:48,288 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:48,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:48,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 04:47:48,289 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:48,290 INFO L82 PathProgramCache]: Analyzing trace with hash 37781676, now seen corresponding path program 1 times [2020-11-07 04:47:48,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:48,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183955003] [2020-11-07 04:47:48,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 04:47:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-11-07 04:47:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 04:47:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:47:48,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183955003] [2020-11-07 04:47:48,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:48,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 04:47:48,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10045651] [2020-11-07 04:47:48,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 04:47:48,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 04:47:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 04:47:48,459 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand 5 states. [2020-11-07 04:47:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:49,003 INFO L93 Difference]: Finished difference Result 273 states and 320 transitions. [2020-11-07 04:47:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:47:49,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2020-11-07 04:47:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:49,008 INFO L225 Difference]: With dead ends: 273 [2020-11-07 04:47:49,008 INFO L226 Difference]: Without dead ends: 175 [2020-11-07 04:47:49,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:47:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-11-07 04:47:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2020-11-07 04:47:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-11-07 04:47:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2020-11-07 04:47:49,044 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 111 [2020-11-07 04:47:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:49,044 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2020-11-07 04:47:49,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 04:47:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2020-11-07 04:47:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 04:47:49,046 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:49,046 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, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:49,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 04:47:49,047 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1061811624, now seen corresponding path program 1 times [2020-11-07 04:47:49,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:49,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [733949587] [2020-11-07 04:47:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 04:47:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 04:47:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 04:47:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:49,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [733949587] [2020-11-07 04:47:49,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:49,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 04:47:49,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709957540] [2020-11-07 04:47:49,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 04:47:49,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:49,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 04:47:49,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 04:47:49,213 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 5 states. [2020-11-07 04:47:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:49,725 INFO L93 Difference]: Finished difference Result 284 states and 333 transitions. [2020-11-07 04:47:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 04:47:49,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-11-07 04:47:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:49,728 INFO L225 Difference]: With dead ends: 284 [2020-11-07 04:47:49,728 INFO L226 Difference]: Without dead ends: 176 [2020-11-07 04:47:49,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:47:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-07 04:47:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-11-07 04:47:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 04:47:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2020-11-07 04:47:49,762 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 114 [2020-11-07 04:47:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:49,762 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2020-11-07 04:47:49,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 04:47:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2020-11-07 04:47:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-07 04:47:49,764 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:49,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:49,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 04:47:49,765 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:49,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash -503903925, now seen corresponding path program 1 times [2020-11-07 04:47:49,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:49,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1232078442] [2020-11-07 04:47:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 04:47:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 04:47:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 04:47:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:49,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1232078442] [2020-11-07 04:47:49,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:49,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 04:47:49,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938619594] [2020-11-07 04:47:49,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:47:49,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:49,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:47:49,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:47:49,973 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand 6 states. [2020-11-07 04:47:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:50,726 INFO L93 Difference]: Finished difference Result 320 states and 377 transitions. [2020-11-07 04:47:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:47:50,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-11-07 04:47:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:50,729 INFO L225 Difference]: With dead ends: 320 [2020-11-07 04:47:50,729 INFO L226 Difference]: Without dead ends: 199 [2020-11-07 04:47:50,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:47:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-11-07 04:47:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2020-11-07 04:47:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-11-07 04:47:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 209 transitions. [2020-11-07 04:47:50,765 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 209 transitions. Word has length 119 [2020-11-07 04:47:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:50,766 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 209 transitions. [2020-11-07 04:47:50,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:47:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 209 transitions. [2020-11-07 04:47:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-07 04:47:50,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:50,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:50,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 04:47:50,768 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:50,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1598599897, now seen corresponding path program 1 times [2020-11-07 04:47:50,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:50,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [264640865] [2020-11-07 04:47:50,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 04:47:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 04:47:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 04:47:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:47:50,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [264640865] [2020-11-07 04:47:50,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:50,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 04:47:50,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76773960] [2020-11-07 04:47:50,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:47:50,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:50,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:47:50,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:47:50,972 INFO L87 Difference]: Start difference. First operand 180 states and 209 transitions. Second operand 6 states. [2020-11-07 04:47:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:51,588 INFO L93 Difference]: Finished difference Result 320 states and 377 transitions. [2020-11-07 04:47:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:47:51,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-11-07 04:47:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:51,591 INFO L225 Difference]: With dead ends: 320 [2020-11-07 04:47:51,591 INFO L226 Difference]: Without dead ends: 201 [2020-11-07 04:47:51,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:47:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-11-07 04:47:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2020-11-07 04:47:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-11-07 04:47:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2020-11-07 04:47:51,637 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 119 [2020-11-07 04:47:51,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:51,637 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2020-11-07 04:47:51,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:47:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2020-11-07 04:47:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-11-07 04:47:51,639 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:51,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:51,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 04:47:51,640 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:51,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:51,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1705231240, now seen corresponding path program 2 times [2020-11-07 04:47:51,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:51,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465960075] [2020-11-07 04:47:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 04:47:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:47:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 04:47:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:51,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465960075] [2020-11-07 04:47:51,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:51,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:47:51,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241838753] [2020-11-07 04:47:51,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:47:51,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:51,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:47:51,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:47:51,861 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 7 states. [2020-11-07 04:47:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:52,514 INFO L93 Difference]: Finished difference Result 354 states and 418 transitions. [2020-11-07 04:47:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:47:52,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-11-07 04:47:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:52,517 INFO L225 Difference]: With dead ends: 354 [2020-11-07 04:47:52,517 INFO L226 Difference]: Without dead ends: 225 [2020-11-07 04:47:52,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:47:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-11-07 04:47:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 193. [2020-11-07 04:47:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-11-07 04:47:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2020-11-07 04:47:52,578 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 124 [2020-11-07 04:47:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:52,580 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2020-11-07 04:47:52,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:47:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2020-11-07 04:47:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-11-07 04:47:52,586 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:52,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:52,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 04:47:52,587 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash -487232234, now seen corresponding path program 1 times [2020-11-07 04:47:52,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:52,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [621849221] [2020-11-07 04:47:52,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 04:47:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 04:47:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 04:47:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:47:52,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [621849221] [2020-11-07 04:47:52,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:52,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:47:52,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037320857] [2020-11-07 04:47:52,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:47:52,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:52,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:47:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:47:52,825 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 7 states. [2020-11-07 04:47:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:53,670 INFO L93 Difference]: Finished difference Result 348 states and 412 transitions. [2020-11-07 04:47:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:47:53,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-11-07 04:47:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:53,674 INFO L225 Difference]: With dead ends: 348 [2020-11-07 04:47:53,674 INFO L226 Difference]: Without dead ends: 221 [2020-11-07 04:47:53,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:47:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-07 04:47:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2020-11-07 04:47:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-11-07 04:47:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2020-11-07 04:47:53,722 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 124 [2020-11-07 04:47:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:53,723 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2020-11-07 04:47:53,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:47:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2020-11-07 04:47:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 04:47:53,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:53,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:53,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 04:47:53,726 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash 452126571, now seen corresponding path program 3 times [2020-11-07 04:47:53,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:53,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [153020788] [2020-11-07 04:47:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 04:47:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 04:47:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-07 04:47:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:53,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [153020788] [2020-11-07 04:47:53,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:53,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:47:53,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439943807] [2020-11-07 04:47:53,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:47:53,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:53,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:47:53,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:47:53,895 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 8 states. [2020-11-07 04:47:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:54,838 INFO L93 Difference]: Finished difference Result 381 states and 451 transitions. [2020-11-07 04:47:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:47:54,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2020-11-07 04:47:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:54,842 INFO L225 Difference]: With dead ends: 381 [2020-11-07 04:47:54,842 INFO L226 Difference]: Without dead ends: 247 [2020-11-07 04:47:54,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:47:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-11-07 04:47:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 203. [2020-11-07 04:47:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-11-07 04:47:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2020-11-07 04:47:54,878 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 129 [2020-11-07 04:47:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:54,879 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2020-11-07 04:47:54,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:47:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2020-11-07 04:47:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 04:47:54,881 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:54,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:54,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 04:47:54,881 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:54,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1740336903, now seen corresponding path program 2 times [2020-11-07 04:47:54,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:54,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907211649] [2020-11-07 04:47:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:54,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 04:47:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 04:47:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-07 04:47:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:47:55,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907211649] [2020-11-07 04:47:55,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:55,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 04:47:55,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873541117] [2020-11-07 04:47:55,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:47:55,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:55,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:47:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:47:55,113 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand 8 states. [2020-11-07 04:47:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:56,055 INFO L93 Difference]: Finished difference Result 367 states and 437 transitions. [2020-11-07 04:47:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:47:56,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2020-11-07 04:47:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:56,059 INFO L225 Difference]: With dead ends: 367 [2020-11-07 04:47:56,059 INFO L226 Difference]: Without dead ends: 235 [2020-11-07 04:47:56,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:47:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-07 04:47:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2020-11-07 04:47:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-11-07 04:47:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2020-11-07 04:47:56,098 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 129 [2020-11-07 04:47:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:56,098 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2020-11-07 04:47:56,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:47:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2020-11-07 04:47:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-07 04:47:56,100 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:56,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:56,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 04:47:56,101 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:56,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:56,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1677870744, now seen corresponding path program 4 times [2020-11-07 04:47:56,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:56,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [148787127] [2020-11-07 04:47:56,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 04:47:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 04:47:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-07 04:47:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:56,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [148787127] [2020-11-07 04:47:56,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:56,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 04:47:56,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581385672] [2020-11-07 04:47:56,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:47:56,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:47:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:47:56,329 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand 9 states. [2020-11-07 04:47:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:57,417 INFO L93 Difference]: Finished difference Result 408 states and 484 transitions. [2020-11-07 04:47:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 04:47:57,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-11-07 04:47:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:57,426 INFO L225 Difference]: With dead ends: 408 [2020-11-07 04:47:57,426 INFO L226 Difference]: Without dead ends: 269 [2020-11-07 04:47:57,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:47:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-11-07 04:47:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 213. [2020-11-07 04:47:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-11-07 04:47:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2020-11-07 04:47:57,493 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 134 [2020-11-07 04:47:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:57,494 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2020-11-07 04:47:57,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:47:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2020-11-07 04:47:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-07 04:47:57,496 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:57,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:57,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 04:47:57,497 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash 424633078, now seen corresponding path program 3 times [2020-11-07 04:47:57,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:57,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [266283309] [2020-11-07 04:47:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 04:47:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 04:47:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-07 04:47:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:47:57,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [266283309] [2020-11-07 04:47:57,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:57,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 04:47:57,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220097725] [2020-11-07 04:47:57,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:47:57,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:57,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:47:57,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:47:57,742 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand 9 states. [2020-11-07 04:47:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:47:58,874 INFO L93 Difference]: Finished difference Result 386 states and 462 transitions. [2020-11-07 04:47:58,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 04:47:58,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-11-07 04:47:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:47:58,878 INFO L225 Difference]: With dead ends: 386 [2020-11-07 04:47:58,878 INFO L226 Difference]: Without dead ends: 249 [2020-11-07 04:47:58,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:47:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-11-07 04:47:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 213. [2020-11-07 04:47:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-11-07 04:47:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2020-11-07 04:47:58,920 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 134 [2020-11-07 04:47:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:47:58,920 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2020-11-07 04:47:58,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:47:58,921 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2020-11-07 04:47:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-07 04:47:58,922 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:47:58,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:47:58,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 04:47:58,923 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:47:58,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:47:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2050515573, now seen corresponding path program 5 times [2020-11-07 04:47:58,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:47:58,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515631047] [2020-11-07 04:47:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:47:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:58,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:47:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:58,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:47:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:58,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:47:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 04:47:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-07 04:47:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 04:47:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:47:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:47:59,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515631047] [2020-11-07 04:47:59,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:47:59,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:47:59,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289799988] [2020-11-07 04:47:59,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:47:59,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:47:59,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:47:59,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:47:59,101 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand 10 states. [2020-11-07 04:48:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:00,401 INFO L93 Difference]: Finished difference Result 435 states and 517 transitions. [2020-11-07 04:48:00,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:48:00,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2020-11-07 04:48:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:00,405 INFO L225 Difference]: With dead ends: 435 [2020-11-07 04:48:00,405 INFO L226 Difference]: Without dead ends: 291 [2020-11-07 04:48:00,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=184, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:48:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-11-07 04:48:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2020-11-07 04:48:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-11-07 04:48:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2020-11-07 04:48:00,448 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 139 [2020-11-07 04:48:00,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:00,449 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2020-11-07 04:48:00,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:48:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2020-11-07 04:48:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-07 04:48:00,451 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:00,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:00,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 04:48:00,451 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:00,452 INFO L82 PathProgramCache]: Analyzing trace with hash 51988249, now seen corresponding path program 4 times [2020-11-07 04:48:00,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:00,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005499019] [2020-11-07 04:48:00,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 04:48:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-11-07 04:48:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 04:48:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:00,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005499019] [2020-11-07 04:48:00,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:00,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:48:00,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730661090] [2020-11-07 04:48:00,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:48:00,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:00,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:48:00,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:48:00,685 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 10 states. [2020-11-07 04:48:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:02,087 INFO L93 Difference]: Finished difference Result 405 states and 487 transitions. [2020-11-07 04:48:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:48:02,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2020-11-07 04:48:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:02,094 INFO L225 Difference]: With dead ends: 405 [2020-11-07 04:48:02,094 INFO L226 Difference]: Without dead ends: 263 [2020-11-07 04:48:02,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:48:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-07 04:48:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 223. [2020-11-07 04:48:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-11-07 04:48:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2020-11-07 04:48:02,139 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 139 [2020-11-07 04:48:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:02,139 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2020-11-07 04:48:02,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:48:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2020-11-07 04:48:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 04:48:02,141 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:02,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:02,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 04:48:02,142 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:02,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:02,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1639590072, now seen corresponding path program 6 times [2020-11-07 04:48:02,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:02,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59015740] [2020-11-07 04:48:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-07 04:48:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 04:48:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 04:48:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 99 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:02,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59015740] [2020-11-07 04:48:02,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:02,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:48:02,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305715235] [2020-11-07 04:48:02,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:48:02,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:02,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:48:02,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:48:02,350 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 11 states. [2020-11-07 04:48:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:03,606 INFO L93 Difference]: Finished difference Result 462 states and 550 transitions. [2020-11-07 04:48:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 04:48:03,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2020-11-07 04:48:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:03,613 INFO L225 Difference]: With dead ends: 462 [2020-11-07 04:48:03,613 INFO L226 Difference]: Without dead ends: 313 [2020-11-07 04:48:03,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=229, Unknown=0, NotChecked=0, Total=380 [2020-11-07 04:48:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-11-07 04:48:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 233. [2020-11-07 04:48:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-11-07 04:48:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2020-11-07 04:48:03,661 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 144 [2020-11-07 04:48:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:03,661 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2020-11-07 04:48:03,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:48:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2020-11-07 04:48:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 04:48:03,663 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:03,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:03,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 04:48:03,664 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash 462913750, now seen corresponding path program 5 times [2020-11-07 04:48:03,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:03,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1666517778] [2020-11-07 04:48:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-07 04:48:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 04:48:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 04:48:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 7 proven. 89 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:03,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1666517778] [2020-11-07 04:48:03,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:03,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:48:03,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124968214] [2020-11-07 04:48:03,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:48:03,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:03,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:48:03,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:48:03,941 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 11 states. [2020-11-07 04:48:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:05,553 INFO L93 Difference]: Finished difference Result 424 states and 512 transitions. [2020-11-07 04:48:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 04:48:05,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2020-11-07 04:48:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:05,559 INFO L225 Difference]: With dead ends: 424 [2020-11-07 04:48:05,559 INFO L226 Difference]: Without dead ends: 277 [2020-11-07 04:48:05,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2020-11-07 04:48:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-11-07 04:48:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 233. [2020-11-07 04:48:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-11-07 04:48:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2020-11-07 04:48:05,620 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 144 [2020-11-07 04:48:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:05,620 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2020-11-07 04:48:05,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:48:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2020-11-07 04:48:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 04:48:05,622 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:05,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:05,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 04:48:05,623 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:05,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1421399125, now seen corresponding path program 7 times [2020-11-07 04:48:05,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:05,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267125380] [2020-11-07 04:48:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 04:48:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 04:48:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-11-07 04:48:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 131 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:05,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267125380] [2020-11-07 04:48:05,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:05,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 04:48:05,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167648122] [2020-11-07 04:48:05,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 04:48:05,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:05,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 04:48:05,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:48:05,870 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 12 states. [2020-11-07 04:48:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:07,222 INFO L93 Difference]: Finished difference Result 489 states and 583 transitions. [2020-11-07 04:48:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:48:07,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2020-11-07 04:48:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:07,225 INFO L225 Difference]: With dead ends: 489 [2020-11-07 04:48:07,225 INFO L226 Difference]: Without dead ends: 335 [2020-11-07 04:48:07,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2020-11-07 04:48:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-11-07 04:48:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 243. [2020-11-07 04:48:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-11-07 04:48:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2020-11-07 04:48:07,277 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 149 [2020-11-07 04:48:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:07,278 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2020-11-07 04:48:07,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 04:48:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2020-11-07 04:48:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 04:48:07,279 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:07,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:07,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 04:48:07,280 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:07,281 INFO L82 PathProgramCache]: Analyzing trace with hash 681104697, now seen corresponding path program 6 times [2020-11-07 04:48:07,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:07,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1479174169] [2020-11-07 04:48:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 04:48:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 04:48:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-11-07 04:48:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:07,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1479174169] [2020-11-07 04:48:07,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:07,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 04:48:07,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651115002] [2020-11-07 04:48:07,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 04:48:07,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 04:48:07,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:48:07,589 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 12 states. [2020-11-07 04:48:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:09,508 INFO L93 Difference]: Finished difference Result 443 states and 537 transitions. [2020-11-07 04:48:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:48:09,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2020-11-07 04:48:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:09,512 INFO L225 Difference]: With dead ends: 443 [2020-11-07 04:48:09,513 INFO L226 Difference]: Without dead ends: 291 [2020-11-07 04:48:09,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2020-11-07 04:48:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-11-07 04:48:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 243. [2020-11-07 04:48:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-11-07 04:48:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2020-11-07 04:48:09,568 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 149 [2020-11-07 04:48:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:09,568 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2020-11-07 04:48:09,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 04:48:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2020-11-07 04:48:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-11-07 04:48:09,570 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:09,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:09,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 04:48:09,570 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:09,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:09,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1763042008, now seen corresponding path program 8 times [2020-11-07 04:48:09,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:09,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468280697] [2020-11-07 04:48:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 04:48:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 04:48:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-11-07 04:48:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:09,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468280697] [2020-11-07 04:48:09,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:09,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 04:48:09,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932264045] [2020-11-07 04:48:09,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 04:48:09,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:09,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 04:48:09,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:48:09,840 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 13 states. [2020-11-07 04:48:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:11,513 INFO L93 Difference]: Finished difference Result 516 states and 616 transitions. [2020-11-07 04:48:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 04:48:11,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2020-11-07 04:48:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:11,517 INFO L225 Difference]: With dead ends: 516 [2020-11-07 04:48:11,517 INFO L226 Difference]: Without dead ends: 357 [2020-11-07 04:48:11,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2020-11-07 04:48:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-11-07 04:48:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 253. [2020-11-07 04:48:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-11-07 04:48:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 303 transitions. [2020-11-07 04:48:11,577 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 303 transitions. Word has length 154 [2020-11-07 04:48:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:11,577 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 303 transitions. [2020-11-07 04:48:11,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 04:48:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 303 transitions. [2020-11-07 04:48:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-11-07 04:48:11,579 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:11,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:11,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 04:48:11,580 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:11,580 INFO L82 PathProgramCache]: Analyzing trace with hash 339461814, now seen corresponding path program 7 times [2020-11-07 04:48:11,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:11,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347674068] [2020-11-07 04:48:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:11,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:11,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:11,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:11,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 04:48:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:11,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 04:48:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:11,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-11-07 04:48:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 7 proven. 154 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:11,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347674068] [2020-11-07 04:48:11,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:11,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 04:48:11,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910707059] [2020-11-07 04:48:11,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 04:48:11,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:11,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 04:48:11,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:48:11,954 INFO L87 Difference]: Start difference. First operand 253 states and 303 transitions. Second operand 13 states. [2020-11-07 04:48:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:13,681 INFO L93 Difference]: Finished difference Result 462 states and 562 transitions. [2020-11-07 04:48:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 04:48:13,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2020-11-07 04:48:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:13,684 INFO L225 Difference]: With dead ends: 462 [2020-11-07 04:48:13,684 INFO L226 Difference]: Without dead ends: 305 [2020-11-07 04:48:13,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2020-11-07 04:48:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-11-07 04:48:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 253. [2020-11-07 04:48:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-11-07 04:48:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 303 transitions. [2020-11-07 04:48:13,740 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 303 transitions. Word has length 154 [2020-11-07 04:48:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:13,740 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 303 transitions. [2020-11-07 04:48:13,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 04:48:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 303 transitions. [2020-11-07 04:48:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-07 04:48:13,742 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:13,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:13,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 04:48:13,743 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:13,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1245474357, now seen corresponding path program 9 times [2020-11-07 04:48:13,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:13,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052430236] [2020-11-07 04:48:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-11-07 04:48:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-11-07 04:48:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:13,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-11-07 04:48:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:14,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052430236] [2020-11-07 04:48:14,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:14,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 04:48:14,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128227849] [2020-11-07 04:48:14,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 04:48:14,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:14,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 04:48:14,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:48:14,022 INFO L87 Difference]: Start difference. First operand 253 states and 303 transitions. Second operand 14 states. [2020-11-07 04:48:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:15,698 INFO L93 Difference]: Finished difference Result 543 states and 649 transitions. [2020-11-07 04:48:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 04:48:15,707 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2020-11-07 04:48:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:15,709 INFO L225 Difference]: With dead ends: 543 [2020-11-07 04:48:15,710 INFO L226 Difference]: Without dead ends: 379 [2020-11-07 04:48:15,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=394, Unknown=0, NotChecked=0, Total=650 [2020-11-07 04:48:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-11-07 04:48:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 263. [2020-11-07 04:48:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-11-07 04:48:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-11-07 04:48:15,789 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 159 [2020-11-07 04:48:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:15,789 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-11-07 04:48:15,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 04:48:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-11-07 04:48:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-07 04:48:15,791 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:15,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:15,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 04:48:15,791 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash 857029465, now seen corresponding path program 8 times [2020-11-07 04:48:15,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:15,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1861310748] [2020-11-07 04:48:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:15,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:16,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-11-07 04:48:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:16,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-11-07 04:48:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:16,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-11-07 04:48:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 7 proven. 194 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:16,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1861310748] [2020-11-07 04:48:16,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:16,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 04:48:16,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673863381] [2020-11-07 04:48:16,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 04:48:16,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:16,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 04:48:16,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-11-07 04:48:16,167 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 14 states. [2020-11-07 04:48:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:18,029 INFO L93 Difference]: Finished difference Result 481 states and 587 transitions. [2020-11-07 04:48:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 04:48:18,033 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2020-11-07 04:48:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:18,035 INFO L225 Difference]: With dead ends: 481 [2020-11-07 04:48:18,035 INFO L226 Difference]: Without dead ends: 319 [2020-11-07 04:48:18,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2020-11-07 04:48:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-11-07 04:48:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 263. [2020-11-07 04:48:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-11-07 04:48:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-11-07 04:48:18,090 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 159 [2020-11-07 04:48:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:18,091 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-11-07 04:48:18,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 04:48:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-11-07 04:48:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-07 04:48:18,092 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:18,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:18,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 04:48:18,093 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash -19363064, now seen corresponding path program 10 times [2020-11-07 04:48:18,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:18,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [976894938] [2020-11-07 04:48:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:18,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:18,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:18,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:18,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 04:48:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:18,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 04:48:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:18,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 04:48:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 6 proven. 257 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:18,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [976894938] [2020-11-07 04:48:18,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:18,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 04:48:18,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722217574] [2020-11-07 04:48:18,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 04:48:18,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:18,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 04:48:18,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=118, Unknown=0, NotChecked=0, Total=210 [2020-11-07 04:48:18,399 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 15 states. [2020-11-07 04:48:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:20,527 INFO L93 Difference]: Finished difference Result 570 states and 682 transitions. [2020-11-07 04:48:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 04:48:20,533 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2020-11-07 04:48:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:20,536 INFO L225 Difference]: With dead ends: 570 [2020-11-07 04:48:20,536 INFO L226 Difference]: Without dead ends: 401 [2020-11-07 04:48:20,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=459, Unknown=0, NotChecked=0, Total=756 [2020-11-07 04:48:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2020-11-07 04:48:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 273. [2020-11-07 04:48:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-11-07 04:48:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2020-11-07 04:48:20,599 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 164 [2020-11-07 04:48:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:20,600 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2020-11-07 04:48:20,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 04:48:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2020-11-07 04:48:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-07 04:48:20,601 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:20,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:20,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 04:48:20,602 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2083140758, now seen corresponding path program 9 times [2020-11-07 04:48:20,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:20,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1971963241] [2020-11-07 04:48:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:20,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:20,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:20,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:20,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 04:48:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:20,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 04:48:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:20,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 04:48:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 7 proven. 239 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:21,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1971963241] [2020-11-07 04:48:21,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:21,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 04:48:21,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239072416] [2020-11-07 04:48:21,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 04:48:21,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:21,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 04:48:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 04:48:21,040 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand 15 states. [2020-11-07 04:48:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:23,793 INFO L93 Difference]: Finished difference Result 500 states and 612 transitions. [2020-11-07 04:48:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 04:48:23,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2020-11-07 04:48:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:23,796 INFO L225 Difference]: With dead ends: 500 [2020-11-07 04:48:23,797 INFO L226 Difference]: Without dead ends: 333 [2020-11-07 04:48:23,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2020-11-07 04:48:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-11-07 04:48:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 273. [2020-11-07 04:48:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-11-07 04:48:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2020-11-07 04:48:23,862 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 164 [2020-11-07 04:48:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:23,863 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2020-11-07 04:48:23,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 04:48:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2020-11-07 04:48:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 04:48:23,865 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:23,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:23,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 04:48:23,865 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:23,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1861300245, now seen corresponding path program 11 times [2020-11-07 04:48:23,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:23,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1797221980] [2020-11-07 04:48:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:23,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:23,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:23,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:24,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-11-07 04:48:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:24,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 04:48:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:24,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-11-07 04:48:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 6 proven. 309 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:24,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1797221980] [2020-11-07 04:48:24,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:24,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 04:48:24,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985795101] [2020-11-07 04:48:24,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 04:48:24,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:24,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 04:48:24,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:48:24,235 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand 16 states. [2020-11-07 04:48:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:26,514 INFO L93 Difference]: Finished difference Result 597 states and 715 transitions. [2020-11-07 04:48:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 04:48:26,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2020-11-07 04:48:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:26,517 INFO L225 Difference]: With dead ends: 597 [2020-11-07 04:48:26,517 INFO L226 Difference]: Without dead ends: 423 [2020-11-07 04:48:26,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=341, Invalid=529, Unknown=0, NotChecked=0, Total=870 [2020-11-07 04:48:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-11-07 04:48:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 283. [2020-11-07 04:48:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-11-07 04:48:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 342 transitions. [2020-11-07 04:48:26,588 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 342 transitions. Word has length 169 [2020-11-07 04:48:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:26,588 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 342 transitions. [2020-11-07 04:48:26,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 04:48:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 342 transitions. [2020-11-07 04:48:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 04:48:26,590 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:26,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:26,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 04:48:26,590 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:26,591 INFO L82 PathProgramCache]: Analyzing trace with hash 241203577, now seen corresponding path program 10 times [2020-11-07 04:48:26,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:26,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1470483463] [2020-11-07 04:48:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:26,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:26,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:26,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:27,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-11-07 04:48:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:27,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 04:48:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:27,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-11-07 04:48:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 289 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:27,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1470483463] [2020-11-07 04:48:27,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:27,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 04:48:27,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16257127] [2020-11-07 04:48:27,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 04:48:27,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:27,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 04:48:27,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:48:27,065 INFO L87 Difference]: Start difference. First operand 283 states and 342 transitions. Second operand 16 states. [2020-11-07 04:48:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:29,410 INFO L93 Difference]: Finished difference Result 519 states and 637 transitions. [2020-11-07 04:48:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 04:48:29,411 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2020-11-07 04:48:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:29,413 INFO L225 Difference]: With dead ends: 519 [2020-11-07 04:48:29,413 INFO L226 Difference]: Without dead ends: 347 [2020-11-07 04:48:29,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2020-11-07 04:48:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-11-07 04:48:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 283. [2020-11-07 04:48:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-11-07 04:48:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 342 transitions. [2020-11-07 04:48:29,491 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 342 transitions. Word has length 169 [2020-11-07 04:48:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:29,492 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 342 transitions. [2020-11-07 04:48:29,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 04:48:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 342 transitions. [2020-11-07 04:48:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-11-07 04:48:29,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:29,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:29,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 04:48:29,493 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:29,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:29,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2105483496, now seen corresponding path program 12 times [2020-11-07 04:48:29,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:29,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1856621245] [2020-11-07 04:48:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-11-07 04:48:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 04:48:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-11-07 04:48:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 366 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:29,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1856621245] [2020-11-07 04:48:29,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:29,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 04:48:29,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210584607] [2020-11-07 04:48:29,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 04:48:29,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:29,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 04:48:29,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=151, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:48:29,829 INFO L87 Difference]: Start difference. First operand 283 states and 342 transitions. Second operand 17 states. [2020-11-07 04:48:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:32,328 INFO L93 Difference]: Finished difference Result 624 states and 748 transitions. [2020-11-07 04:48:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 04:48:32,330 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2020-11-07 04:48:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:32,333 INFO L225 Difference]: With dead ends: 624 [2020-11-07 04:48:32,333 INFO L226 Difference]: Without dead ends: 445 [2020-11-07 04:48:32,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2020-11-07 04:48:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-07 04:48:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 293. [2020-11-07 04:48:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-11-07 04:48:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 355 transitions. [2020-11-07 04:48:32,408 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 355 transitions. Word has length 174 [2020-11-07 04:48:32,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:32,408 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 355 transitions. [2020-11-07 04:48:32,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 04:48:32,408 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2020-11-07 04:48:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-11-07 04:48:32,410 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:32,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:32,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-07 04:48:32,410 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:32,411 INFO L82 PathProgramCache]: Analyzing trace with hash -86979978, now seen corresponding path program 11 times [2020-11-07 04:48:32,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:32,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1419787103] [2020-11-07 04:48:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-11-07 04:48:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 04:48:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-11-07 04:48:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 7 proven. 344 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:32,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1419787103] [2020-11-07 04:48:32,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:32,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 04:48:32,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95826721] [2020-11-07 04:48:32,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 04:48:32,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 04:48:32,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:48:32,933 INFO L87 Difference]: Start difference. First operand 293 states and 355 transitions. Second operand 17 states. [2020-11-07 04:48:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:35,652 INFO L93 Difference]: Finished difference Result 538 states and 662 transitions. [2020-11-07 04:48:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 04:48:35,653 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2020-11-07 04:48:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:35,656 INFO L225 Difference]: With dead ends: 538 [2020-11-07 04:48:35,656 INFO L226 Difference]: Without dead ends: 361 [2020-11-07 04:48:35,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2020-11-07 04:48:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-11-07 04:48:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 293. [2020-11-07 04:48:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-11-07 04:48:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 355 transitions. [2020-11-07 04:48:35,731 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 355 transitions. Word has length 174 [2020-11-07 04:48:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:35,732 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 355 transitions. [2020-11-07 04:48:35,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 04:48:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2020-11-07 04:48:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-07 04:48:35,734 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:35,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:35,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-07 04:48:35,734 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:35,735 INFO L82 PathProgramCache]: Analyzing trace with hash 175826443, now seen corresponding path program 13 times [2020-11-07 04:48:35,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:35,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [46314269] [2020-11-07 04:48:35,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:35,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:35,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:35,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-11-07 04:48:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 04:48:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-07 04:48:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 6 proven. 428 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:36,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [46314269] [2020-11-07 04:48:36,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:36,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 04:48:36,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943783043] [2020-11-07 04:48:36,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 04:48:36,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:36,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 04:48:36,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=169, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:48:36,149 INFO L87 Difference]: Start difference. First operand 293 states and 355 transitions. Second operand 18 states. [2020-11-07 04:48:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:38,017 INFO L93 Difference]: Finished difference Result 651 states and 781 transitions. [2020-11-07 04:48:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 04:48:38,018 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2020-11-07 04:48:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:38,021 INFO L225 Difference]: With dead ends: 651 [2020-11-07 04:48:38,022 INFO L226 Difference]: Without dead ends: 467 [2020-11-07 04:48:38,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=438, Invalid=684, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 04:48:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-11-07 04:48:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 303. [2020-11-07 04:48:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-11-07 04:48:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2020-11-07 04:48:38,106 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 179 [2020-11-07 04:48:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:38,107 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2020-11-07 04:48:38,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 04:48:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2020-11-07 04:48:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-07 04:48:38,108 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:38,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:38,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-07 04:48:38,109 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:38,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:38,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2016637031, now seen corresponding path program 12 times [2020-11-07 04:48:38,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:38,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2146673261] [2020-11-07 04:48:38,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:38,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:38,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:38,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:38,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-11-07 04:48:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:38,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 04:48:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:38,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-07 04:48:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 7 proven. 404 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:38,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2146673261] [2020-11-07 04:48:38,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:38,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 04:48:38,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151464839] [2020-11-07 04:48:38,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 04:48:38,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:38,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 04:48:38,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:48:38,676 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 18 states. [2020-11-07 04:48:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:42,568 INFO L93 Difference]: Finished difference Result 557 states and 687 transitions. [2020-11-07 04:48:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 04:48:42,569 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2020-11-07 04:48:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:42,571 INFO L225 Difference]: With dead ends: 557 [2020-11-07 04:48:42,571 INFO L226 Difference]: Without dead ends: 375 [2020-11-07 04:48:42,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 04:48:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-11-07 04:48:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 303. [2020-11-07 04:48:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-11-07 04:48:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2020-11-07 04:48:42,628 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 179 [2020-11-07 04:48:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:42,629 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2020-11-07 04:48:42,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 04:48:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2020-11-07 04:48:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 04:48:42,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:42,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:42,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-07 04:48:42,631 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:42,632 INFO L82 PathProgramCache]: Analyzing trace with hash -926163256, now seen corresponding path program 14 times [2020-11-07 04:48:42,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:42,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [142106895] [2020-11-07 04:48:42,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-11-07 04:48:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 04:48:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-11-07 04:48:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 6 proven. 495 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:43,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [142106895] [2020-11-07 04:48:43,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:43,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 04:48:43,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498438298] [2020-11-07 04:48:43,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 04:48:43,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:43,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 04:48:43,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=188, Unknown=0, NotChecked=0, Total=342 [2020-11-07 04:48:43,084 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 19 states. [2020-11-07 04:48:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:46,025 INFO L93 Difference]: Finished difference Result 678 states and 814 transitions. [2020-11-07 04:48:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 04:48:46,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2020-11-07 04:48:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:46,028 INFO L225 Difference]: With dead ends: 678 [2020-11-07 04:48:46,028 INFO L226 Difference]: Without dead ends: 489 [2020-11-07 04:48:46,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=491, Invalid=769, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 04:48:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-11-07 04:48:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 313. [2020-11-07 04:48:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-11-07 04:48:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 381 transitions. [2020-11-07 04:48:46,112 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 381 transitions. Word has length 184 [2020-11-07 04:48:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:46,112 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 381 transitions. [2020-11-07 04:48:46,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 04:48:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 381 transitions. [2020-11-07 04:48:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 04:48:46,114 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:46,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:46,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-07 04:48:46,114 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:46,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:46,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1176340566, now seen corresponding path program 13 times [2020-11-07 04:48:46,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:46,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072219856] [2020-11-07 04:48:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-11-07 04:48:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 04:48:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-11-07 04:48:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 7 proven. 469 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:46,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072219856] [2020-11-07 04:48:46,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:46,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 04:48:46,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902782139] [2020-11-07 04:48:46,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 04:48:46,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:46,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 04:48:46,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-11-07 04:48:46,689 INFO L87 Difference]: Start difference. First operand 313 states and 381 transitions. Second operand 19 states. [2020-11-07 04:48:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:50,373 INFO L93 Difference]: Finished difference Result 576 states and 712 transitions. [2020-11-07 04:48:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 04:48:50,376 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2020-11-07 04:48:50,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:50,378 INFO L225 Difference]: With dead ends: 576 [2020-11-07 04:48:50,378 INFO L226 Difference]: Without dead ends: 389 [2020-11-07 04:48:50,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 04:48:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-11-07 04:48:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 313. [2020-11-07 04:48:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-11-07 04:48:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 381 transitions. [2020-11-07 04:48:50,469 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 381 transitions. Word has length 184 [2020-11-07 04:48:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:50,469 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 381 transitions. [2020-11-07 04:48:50,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 04:48:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 381 transitions. [2020-11-07 04:48:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-11-07 04:48:50,471 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:50,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:50,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-07 04:48:50,471 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash -254159829, now seen corresponding path program 15 times [2020-11-07 04:48:50,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:50,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832368060] [2020-11-07 04:48:50,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:48:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-11-07 04:48:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 04:48:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 6 proven. 567 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:50,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832368060] [2020-11-07 04:48:50,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:50,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 04:48:50,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278971781] [2020-11-07 04:48:50,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 04:48:50,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 04:48:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=208, Unknown=0, NotChecked=0, Total=380 [2020-11-07 04:48:50,970 INFO L87 Difference]: Start difference. First operand 313 states and 381 transitions. Second operand 20 states. [2020-11-07 04:48:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:53,966 INFO L93 Difference]: Finished difference Result 705 states and 847 transitions. [2020-11-07 04:48:53,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 04:48:53,972 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 189 [2020-11-07 04:48:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:53,975 INFO L225 Difference]: With dead ends: 705 [2020-11-07 04:48:53,975 INFO L226 Difference]: Without dead ends: 511 [2020-11-07 04:48:53,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=547, Invalid=859, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 04:48:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-11-07 04:48:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 323. [2020-11-07 04:48:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-07 04:48:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2020-11-07 04:48:54,069 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 189 [2020-11-07 04:48:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:54,069 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2020-11-07 04:48:54,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 04:48:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2020-11-07 04:48:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-11-07 04:48:54,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:54,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:54,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-07 04:48:54,073 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1848343993, now seen corresponding path program 14 times [2020-11-07 04:48:54,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:54,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [375859752] [2020-11-07 04:48:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 04:48:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-11-07 04:48:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 04:48:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 7 proven. 539 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:48:54,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [375859752] [2020-11-07 04:48:54,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:54,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 04:48:54,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509159929] [2020-11-07 04:48:54,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 04:48:54,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:54,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 04:48:54,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-11-07 04:48:54,776 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 20 states. [2020-11-07 04:48:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:59,088 INFO L93 Difference]: Finished difference Result 595 states and 737 transitions. [2020-11-07 04:48:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 04:48:59,089 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 189 [2020-11-07 04:48:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:59,091 INFO L225 Difference]: With dead ends: 595 [2020-11-07 04:48:59,091 INFO L226 Difference]: Without dead ends: 403 [2020-11-07 04:48:59,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 04:48:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2020-11-07 04:48:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 323. [2020-11-07 04:48:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-07 04:48:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2020-11-07 04:48:59,193 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 189 [2020-11-07 04:48:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:59,194 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2020-11-07 04:48:59,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 04:48:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2020-11-07 04:48:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-11-07 04:48:59,195 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:59,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:59,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-07 04:48:59,196 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:59,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:59,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2060663640, now seen corresponding path program 16 times [2020-11-07 04:48:59,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:59,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [285764857] [2020-11-07 04:48:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:59,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:59,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:48:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:59,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:48:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:59,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 04:48:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:59,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-11-07 04:48:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:59,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 04:48:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 6 proven. 644 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:48:59,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [285764857] [2020-11-07 04:48:59,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:59,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 04:48:59,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451849714] [2020-11-07 04:48:59,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 04:48:59,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 04:48:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=229, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:48:59,760 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 21 states. [2020-11-07 04:49:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:03,120 INFO L93 Difference]: Finished difference Result 732 states and 880 transitions. [2020-11-07 04:49:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 04:49:03,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2020-11-07 04:49:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:03,123 INFO L225 Difference]: With dead ends: 732 [2020-11-07 04:49:03,123 INFO L226 Difference]: Without dead ends: 533 [2020-11-07 04:49:03,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 04:49:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-11-07 04:49:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 333. [2020-11-07 04:49:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-07 04:49:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 407 transitions. [2020-11-07 04:49:03,208 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 407 transitions. Word has length 194 [2020-11-07 04:49:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:03,208 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 407 transitions. [2020-11-07 04:49:03,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 04:49:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 407 transitions. [2020-11-07 04:49:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-11-07 04:49:03,209 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:03,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:03,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-07 04:49:03,210 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash 41840182, now seen corresponding path program 15 times [2020-11-07 04:49:03,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:03,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153882562] [2020-11-07 04:49:03,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 04:49:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-11-07 04:49:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 04:49:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 7 proven. 614 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:03,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153882562] [2020-11-07 04:49:03,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:03,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 04:49:03,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920425761] [2020-11-07 04:49:03,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 04:49:03,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:03,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 04:49:03,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:49:03,958 INFO L87 Difference]: Start difference. First operand 333 states and 407 transitions. Second operand 21 states. [2020-11-07 04:49:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:07,975 INFO L93 Difference]: Finished difference Result 614 states and 762 transitions. [2020-11-07 04:49:07,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 04:49:07,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2020-11-07 04:49:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:07,979 INFO L225 Difference]: With dead ends: 614 [2020-11-07 04:49:07,979 INFO L226 Difference]: Without dead ends: 417 [2020-11-07 04:49:07,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 04:49:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-07 04:49:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 333. [2020-11-07 04:49:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-07 04:49:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 407 transitions. [2020-11-07 04:49:08,067 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 407 transitions. Word has length 194 [2020-11-07 04:49:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:08,067 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 407 transitions. [2020-11-07 04:49:08,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 04:49:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 407 transitions. [2020-11-07 04:49:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-07 04:49:08,069 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:08,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:08,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-07 04:49:08,069 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:08,070 INFO L82 PathProgramCache]: Analyzing trace with hash 880646731, now seen corresponding path program 17 times [2020-11-07 04:49:08,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:08,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297412344] [2020-11-07 04:49:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-11-07 04:49:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-11-07 04:49:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 04:49:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 6 proven. 726 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:08,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297412344] [2020-11-07 04:49:08,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:08,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 04:49:08,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970890143] [2020-11-07 04:49:08,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 04:49:08,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 04:49:08,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=251, Unknown=0, NotChecked=0, Total=462 [2020-11-07 04:49:08,649 INFO L87 Difference]: Start difference. First operand 333 states and 407 transitions. Second operand 22 states. [2020-11-07 04:49:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:12,049 INFO L93 Difference]: Finished difference Result 759 states and 913 transitions. [2020-11-07 04:49:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 04:49:12,050 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 199 [2020-11-07 04:49:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:12,053 INFO L225 Difference]: With dead ends: 759 [2020-11-07 04:49:12,053 INFO L226 Difference]: Without dead ends: 555 [2020-11-07 04:49:12,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=668, Invalid=1054, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 04:49:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-11-07 04:49:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 343. [2020-11-07 04:49:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-11-07 04:49:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2020-11-07 04:49:12,157 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 199 [2020-11-07 04:49:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:12,157 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2020-11-07 04:49:12,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 04:49:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2020-11-07 04:49:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-07 04:49:12,159 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:12,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:12,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-07 04:49:12,160 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1311816743, now seen corresponding path program 16 times [2020-11-07 04:49:12,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:12,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [879976409] [2020-11-07 04:49:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-11-07 04:49:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-11-07 04:49:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 04:49:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 7 proven. 694 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:12,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [879976409] [2020-11-07 04:49:12,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:12,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 04:49:12,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39500897] [2020-11-07 04:49:12,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 04:49:12,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:12,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 04:49:12,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2020-11-07 04:49:12,931 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand 22 states. [2020-11-07 04:49:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:18,686 INFO L93 Difference]: Finished difference Result 633 states and 787 transitions. [2020-11-07 04:49:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 04:49:18,688 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 199 [2020-11-07 04:49:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:18,690 INFO L225 Difference]: With dead ends: 633 [2020-11-07 04:49:18,691 INFO L226 Difference]: Without dead ends: 431 [2020-11-07 04:49:18,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=260, Invalid=1462, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 04:49:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-11-07 04:49:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 343. [2020-11-07 04:49:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-11-07 04:49:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2020-11-07 04:49:18,784 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 199 [2020-11-07 04:49:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:18,784 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2020-11-07 04:49:18,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 04:49:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2020-11-07 04:49:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-11-07 04:49:18,786 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:18,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:18,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-07 04:49:18,786 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:18,787 INFO L82 PathProgramCache]: Analyzing trace with hash 630182536, now seen corresponding path program 18 times [2020-11-07 04:49:18,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:18,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [504393704] [2020-11-07 04:49:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:18,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:18,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:18,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:19,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 04:49:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:19,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-07 04:49:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:19,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 04:49:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 6 proven. 813 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:19,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [504393704] [2020-11-07 04:49:19,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:19,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 04:49:19,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576753388] [2020-11-07 04:49:19,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 04:49:19,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:19,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 04:49:19,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2020-11-07 04:49:19,403 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand 23 states. [2020-11-07 04:49:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:21,955 INFO L93 Difference]: Finished difference Result 786 states and 946 transitions. [2020-11-07 04:49:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 04:49:21,956 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 204 [2020-11-07 04:49:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:21,959 INFO L225 Difference]: With dead ends: 786 [2020-11-07 04:49:21,959 INFO L226 Difference]: Without dead ends: 577 [2020-11-07 04:49:21,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=733, Invalid=1159, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 04:49:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-11-07 04:49:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 353. [2020-11-07 04:49:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-11-07 04:49:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2020-11-07 04:49:22,063 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 204 [2020-11-07 04:49:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:22,064 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2020-11-07 04:49:22,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 04:49:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2020-11-07 04:49:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-11-07 04:49:22,066 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:22,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:22,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-07 04:49:22,066 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1562280938, now seen corresponding path program 17 times [2020-11-07 04:49:22,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:22,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [930777880] [2020-11-07 04:49:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:22,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:22,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:22,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:22,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 04:49:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:22,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-07 04:49:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:22,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 04:49:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 7 proven. 779 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:22,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [930777880] [2020-11-07 04:49:22,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:22,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 04:49:22,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064224818] [2020-11-07 04:49:22,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 04:49:22,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 04:49:22,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2020-11-07 04:49:22,896 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand 23 states. [2020-11-07 04:49:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:29,086 INFO L93 Difference]: Finished difference Result 652 states and 812 transitions. [2020-11-07 04:49:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 04:49:29,086 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 204 [2020-11-07 04:49:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:29,088 INFO L225 Difference]: With dead ends: 652 [2020-11-07 04:49:29,088 INFO L226 Difference]: Without dead ends: 445 [2020-11-07 04:49:29,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=274, Invalid=1618, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 04:49:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-07 04:49:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 353. [2020-11-07 04:49:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-11-07 04:49:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2020-11-07 04:49:29,180 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 204 [2020-11-07 04:49:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:29,180 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2020-11-07 04:49:29,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 04:49:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2020-11-07 04:49:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-07 04:49:29,182 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:29,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:29,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-07 04:49:29,182 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:29,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:29,182 INFO L82 PathProgramCache]: Analyzing trace with hash 121124971, now seen corresponding path program 19 times [2020-11-07 04:49:29,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:29,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743814568] [2020-11-07 04:49:29,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:29,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:29,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:29,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:29,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 04:49:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:29,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-11-07 04:49:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:29,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 04:49:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 6 proven. 905 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:29,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743814568] [2020-11-07 04:49:29,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:29,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 04:49:29,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668154034] [2020-11-07 04:49:29,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 04:49:29,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:29,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 04:49:29,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=298, Unknown=0, NotChecked=0, Total=552 [2020-11-07 04:49:29,919 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand 24 states. [2020-11-07 04:49:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:32,913 INFO L93 Difference]: Finished difference Result 813 states and 979 transitions. [2020-11-07 04:49:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 04:49:32,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 209 [2020-11-07 04:49:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:32,917 INFO L225 Difference]: With dead ends: 813 [2020-11-07 04:49:32,917 INFO L226 Difference]: Without dead ends: 599 [2020-11-07 04:49:32,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=801, Invalid=1269, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 04:49:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-11-07 04:49:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 363. [2020-11-07 04:49:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-11-07 04:49:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 446 transitions. [2020-11-07 04:49:33,061 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 446 transitions. Word has length 209 [2020-11-07 04:49:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:33,062 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 446 transitions. [2020-11-07 04:49:33,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 04:49:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 446 transitions. [2020-11-07 04:49:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-07 04:49:33,063 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:33,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:33,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-07 04:49:33,064 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:33,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2071338503, now seen corresponding path program 18 times [2020-11-07 04:49:33,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:33,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1645718890] [2020-11-07 04:49:33,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 04:49:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-11-07 04:49:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 04:49:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 7 proven. 869 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:33,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1645718890] [2020-11-07 04:49:33,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:33,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 04:49:33,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893300433] [2020-11-07 04:49:33,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 04:49:33,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 04:49:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2020-11-07 04:49:33,905 INFO L87 Difference]: Start difference. First operand 363 states and 446 transitions. Second operand 24 states. [2020-11-07 04:49:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:40,566 INFO L93 Difference]: Finished difference Result 671 states and 837 transitions. [2020-11-07 04:49:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 04:49:40,567 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 209 [2020-11-07 04:49:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:40,569 INFO L225 Difference]: With dead ends: 671 [2020-11-07 04:49:40,569 INFO L226 Difference]: Without dead ends: 459 [2020-11-07 04:49:40,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=288, Invalid=1782, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 04:49:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-11-07 04:49:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 363. [2020-11-07 04:49:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-11-07 04:49:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 446 transitions. [2020-11-07 04:49:40,708 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 446 transitions. Word has length 209 [2020-11-07 04:49:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:40,709 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 446 transitions. [2020-11-07 04:49:40,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 04:49:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 446 transitions. [2020-11-07 04:49:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-11-07 04:49:40,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:40,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:40,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-07 04:49:40,711 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash -882702232, now seen corresponding path program 20 times [2020-11-07 04:49:40,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:40,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [178294744] [2020-11-07 04:49:40,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:40,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:40,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:40,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:41,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 04:49:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:41,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-11-07 04:49:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:41,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 04:49:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 6 proven. 1002 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:41,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [178294744] [2020-11-07 04:49:41,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:41,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 04:49:41,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123670426] [2020-11-07 04:49:41,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 04:49:41,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 04:49:41,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=323, Unknown=0, NotChecked=0, Total=600 [2020-11-07 04:49:41,446 INFO L87 Difference]: Start difference. First operand 363 states and 446 transitions. Second operand 25 states. [2020-11-07 04:49:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:44,530 INFO L93 Difference]: Finished difference Result 840 states and 1012 transitions. [2020-11-07 04:49:44,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 04:49:44,530 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2020-11-07 04:49:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:44,534 INFO L225 Difference]: With dead ends: 840 [2020-11-07 04:49:44,534 INFO L226 Difference]: Without dead ends: 621 [2020-11-07 04:49:44,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=872, Invalid=1384, Unknown=0, NotChecked=0, Total=2256 [2020-11-07 04:49:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-11-07 04:49:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 373. [2020-11-07 04:49:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-11-07 04:49:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 459 transitions. [2020-11-07 04:49:44,660 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 459 transitions. Word has length 214 [2020-11-07 04:49:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:44,661 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 459 transitions. [2020-11-07 04:49:44,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 04:49:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 459 transitions. [2020-11-07 04:49:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-11-07 04:49:44,663 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:44,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:44,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-07 04:49:44,663 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:44,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1219801590, now seen corresponding path program 19 times [2020-11-07 04:49:44,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:44,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980629045] [2020-11-07 04:49:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:44,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:44,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:44,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:45,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 04:49:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:45,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-11-07 04:49:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:45,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 04:49:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 7 proven. 964 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:45,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [980629045] [2020-11-07 04:49:45,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:45,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 04:49:45,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130182475] [2020-11-07 04:49:45,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 04:49:45,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:45,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 04:49:45,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-11-07 04:49:45,638 INFO L87 Difference]: Start difference. First operand 373 states and 459 transitions. Second operand 25 states. [2020-11-07 04:49:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:51,298 INFO L93 Difference]: Finished difference Result 690 states and 862 transitions. [2020-11-07 04:49:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 04:49:51,299 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2020-11-07 04:49:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:51,301 INFO L225 Difference]: With dead ends: 690 [2020-11-07 04:49:51,302 INFO L226 Difference]: Without dead ends: 473 [2020-11-07 04:49:51,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=302, Invalid=1954, Unknown=0, NotChecked=0, Total=2256 [2020-11-07 04:49:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-11-07 04:49:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 373. [2020-11-07 04:49:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-11-07 04:49:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 459 transitions. [2020-11-07 04:49:51,396 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 459 transitions. Word has length 214 [2020-11-07 04:49:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:51,396 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 459 transitions. [2020-11-07 04:49:51,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 04:49:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 459 transitions. [2020-11-07 04:49:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-11-07 04:49:51,398 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:51,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:51,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-07 04:49:51,398 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:51,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash -61100405, now seen corresponding path program 21 times [2020-11-07 04:49:51,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:51,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1661250758] [2020-11-07 04:49:51,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:51,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:51,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:51,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:52,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-11-07 04:49:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:52,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-11-07 04:49:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:52,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-11-07 04:49:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 6 proven. 1104 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:49:52,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1661250758] [2020-11-07 04:49:52,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:52,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 04:49:52,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253277633] [2020-11-07 04:49:52,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 04:49:52,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:52,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 04:49:52,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=349, Unknown=0, NotChecked=0, Total=650 [2020-11-07 04:49:52,135 INFO L87 Difference]: Start difference. First operand 373 states and 459 transitions. Second operand 26 states. [2020-11-07 04:49:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:49:56,102 INFO L93 Difference]: Finished difference Result 867 states and 1045 transitions. [2020-11-07 04:49:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 04:49:56,103 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 219 [2020-11-07 04:49:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:49:56,106 INFO L225 Difference]: With dead ends: 867 [2020-11-07 04:49:56,106 INFO L226 Difference]: Without dead ends: 643 [2020-11-07 04:49:56,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=946, Invalid=1504, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 04:49:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-11-07 04:49:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 383. [2020-11-07 04:49:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-11-07 04:49:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2020-11-07 04:49:56,200 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 219 [2020-11-07 04:49:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:49:56,200 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2020-11-07 04:49:56,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 04:49:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2020-11-07 04:49:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-11-07 04:49:56,202 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:49:56,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:49:56,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-07 04:49:56,203 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:49:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:49:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2041403417, now seen corresponding path program 20 times [2020-11-07 04:49:56,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:49:56,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076429703] [2020-11-07 04:49:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:49:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:56,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:49:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:56,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:49:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:56,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:49:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:57,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-11-07 04:49:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:57,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-11-07 04:49:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:57,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-11-07 04:49:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:49:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 7 proven. 1064 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:49:57,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076429703] [2020-11-07 04:49:57,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:49:57,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 04:49:57,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306975751] [2020-11-07 04:49:57,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 04:49:57,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:49:57,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 04:49:57,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2020-11-07 04:49:57,180 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 26 states. [2020-11-07 04:50:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:04,176 INFO L93 Difference]: Finished difference Result 709 states and 887 transitions. [2020-11-07 04:50:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 04:50:04,177 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 219 [2020-11-07 04:50:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:04,179 INFO L225 Difference]: With dead ends: 709 [2020-11-07 04:50:04,179 INFO L226 Difference]: Without dead ends: 487 [2020-11-07 04:50:04,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=316, Invalid=2134, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 04:50:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2020-11-07 04:50:04,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 383. [2020-11-07 04:50:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-11-07 04:50:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2020-11-07 04:50:04,272 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 219 [2020-11-07 04:50:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:04,273 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2020-11-07 04:50:04,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 04:50:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2020-11-07 04:50:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-11-07 04:50:04,275 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:04,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:04,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-07 04:50:04,275 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:04,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash 647259720, now seen corresponding path program 22 times [2020-11-07 04:50:04,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:04,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1463507302] [2020-11-07 04:50:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:04,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:04,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:04,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:05,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-11-07 04:50:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:05,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2020-11-07 04:50:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:05,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-11-07 04:50:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 6 proven. 1211 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:50:05,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1463507302] [2020-11-07 04:50:05,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:05,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-07 04:50:05,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103592057] [2020-11-07 04:50:05,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 04:50:05,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:05,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 04:50:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=376, Unknown=0, NotChecked=0, Total=702 [2020-11-07 04:50:05,119 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 27 states. [2020-11-07 04:50:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:08,568 INFO L93 Difference]: Finished difference Result 894 states and 1078 transitions. [2020-11-07 04:50:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 04:50:08,569 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 224 [2020-11-07 04:50:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:08,572 INFO L225 Difference]: With dead ends: 894 [2020-11-07 04:50:08,572 INFO L226 Difference]: Without dead ends: 665 [2020-11-07 04:50:08,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1023, Invalid=1629, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 04:50:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-11-07 04:50:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 393. [2020-11-07 04:50:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-11-07 04:50:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2020-11-07 04:50:08,716 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 224 [2020-11-07 04:50:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:08,717 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2020-11-07 04:50:08,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 04:50:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2020-11-07 04:50:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-11-07 04:50:08,718 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:08,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:08,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-07 04:50:08,719 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1545203754, now seen corresponding path program 21 times [2020-11-07 04:50:08,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:08,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801700818] [2020-11-07 04:50:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:08,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:08,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:08,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:09,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-11-07 04:50:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:09,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2020-11-07 04:50:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:09,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-11-07 04:50:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 7 proven. 1169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:50:09,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801700818] [2020-11-07 04:50:09,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:09,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-07 04:50:09,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480486094] [2020-11-07 04:50:09,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 04:50:09,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:09,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 04:50:09,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2020-11-07 04:50:09,749 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand 27 states. [2020-11-07 04:50:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:18,190 INFO L93 Difference]: Finished difference Result 728 states and 912 transitions. [2020-11-07 04:50:18,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 04:50:18,191 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 224 [2020-11-07 04:50:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:18,194 INFO L225 Difference]: With dead ends: 728 [2020-11-07 04:50:18,194 INFO L226 Difference]: Without dead ends: 501 [2020-11-07 04:50:18,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=330, Invalid=2322, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 04:50:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-11-07 04:50:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 393. [2020-11-07 04:50:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-11-07 04:50:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2020-11-07 04:50:18,290 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 224 [2020-11-07 04:50:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:18,290 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2020-11-07 04:50:18,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 04:50:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2020-11-07 04:50:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-11-07 04:50:18,292 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:18,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:18,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-07 04:50:18,292 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:18,292 INFO L82 PathProgramCache]: Analyzing trace with hash 683277483, now seen corresponding path program 23 times [2020-11-07 04:50:18,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:18,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190889122] [2020-11-07 04:50:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:18,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:18,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:18,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:19,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-11-07 04:50:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:19,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 04:50:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:19,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-11-07 04:50:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 6 proven. 1323 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:50:19,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190889122] [2020-11-07 04:50:19,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:19,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 04:50:19,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768335546] [2020-11-07 04:50:19,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 04:50:19,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:19,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 04:50:19,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=404, Unknown=0, NotChecked=0, Total=756 [2020-11-07 04:50:19,172 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand 28 states. [2020-11-07 04:50:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:22,860 INFO L93 Difference]: Finished difference Result 921 states and 1111 transitions. [2020-11-07 04:50:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 04:50:22,860 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 229 [2020-11-07 04:50:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:22,864 INFO L225 Difference]: With dead ends: 921 [2020-11-07 04:50:22,864 INFO L226 Difference]: Without dead ends: 687 [2020-11-07 04:50:22,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1103, Invalid=1759, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 04:50:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-11-07 04:50:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 403. [2020-11-07 04:50:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-11-07 04:50:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 498 transitions. [2020-11-07 04:50:22,969 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 498 transitions. Word has length 229 [2020-11-07 04:50:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:22,970 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 498 transitions. [2020-11-07 04:50:22,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 04:50:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 498 transitions. [2020-11-07 04:50:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-11-07 04:50:22,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:22,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:22,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-07 04:50:22,972 INFO L429 AbstractCegarLoop]: === Iteration 50 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1509185991, now seen corresponding path program 22 times [2020-11-07 04:50:22,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:22,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075894026] [2020-11-07 04:50:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:23,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:23,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:23,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:23,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-11-07 04:50:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:23,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-11-07 04:50:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:24,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-11-07 04:50:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 7 proven. 1279 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 04:50:24,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075894026] [2020-11-07 04:50:24,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:24,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 04:50:24,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258672870] [2020-11-07 04:50:24,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 04:50:24,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:24,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 04:50:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2020-11-07 04:50:24,092 INFO L87 Difference]: Start difference. First operand 403 states and 498 transitions. Second operand 28 states. [2020-11-07 04:50:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:33,257 INFO L93 Difference]: Finished difference Result 747 states and 937 transitions. [2020-11-07 04:50:33,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 04:50:33,269 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 229 [2020-11-07 04:50:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:33,272 INFO L225 Difference]: With dead ends: 747 [2020-11-07 04:50:33,272 INFO L226 Difference]: Without dead ends: 515 [2020-11-07 04:50:33,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=344, Invalid=2518, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 04:50:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-11-07 04:50:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 403. [2020-11-07 04:50:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-11-07 04:50:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 498 transitions. [2020-11-07 04:50:33,413 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 498 transitions. Word has length 229 [2020-11-07 04:50:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:33,413 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 498 transitions. [2020-11-07 04:50:33,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 04:50:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 498 transitions. [2020-11-07 04:50:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-07 04:50:33,415 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:33,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:33,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-11-07 04:50:33,415 INFO L429 AbstractCegarLoop]: === Iteration 51 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1435626536, now seen corresponding path program 24 times [2020-11-07 04:50:33,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:33,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238684021] [2020-11-07 04:50:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:33,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-11-07 04:50:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 6 proven. 1440 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 04:50:34,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238684021] [2020-11-07 04:50:34,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:34,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-11-07 04:50:34,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022287735] [2020-11-07 04:50:34,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-07 04:50:34,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:34,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-07 04:50:34,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=433, Unknown=0, NotChecked=0, Total=812 [2020-11-07 04:50:34,339 INFO L87 Difference]: Start difference. First operand 403 states and 498 transitions. Second operand 29 states. [2020-11-07 04:50:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:39,133 INFO L93 Difference]: Finished difference Result 948 states and 1144 transitions. [2020-11-07 04:50:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 04:50:39,134 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-11-07 04:50:39,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:39,138 INFO L225 Difference]: With dead ends: 948 [2020-11-07 04:50:39,138 INFO L226 Difference]: Without dead ends: 709 [2020-11-07 04:50:39,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1186, Invalid=1894, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 04:50:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-11-07 04:50:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 413. [2020-11-07 04:50:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-11-07 04:50:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 511 transitions. [2020-11-07 04:50:39,264 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 511 transitions. Word has length 234 [2020-11-07 04:50:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:39,264 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 511 transitions. [2020-11-07 04:50:39,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-07 04:50:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 511 transitions. [2020-11-07 04:50:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-07 04:50:39,266 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:39,266 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] [2020-11-07 04:50:39,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-07 04:50:39,266 INFO L429 AbstractCegarLoop]: === Iteration 52 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash -756836938, now seen corresponding path program 23 times [2020-11-07 04:50:39,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:39,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120635135] [2020-11-07 04:50:39,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-11-07 04:50:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-11-07 04:50:39,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120635135] [2020-11-07 04:50:39,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:39,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:50:39,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528431627] [2020-11-07 04:50:39,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:50:39,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:39,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:50:39,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:39,618 INFO L87 Difference]: Start difference. First operand 413 states and 511 transitions. Second operand 11 states. [2020-11-07 04:50:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:41,304 INFO L93 Difference]: Finished difference Result 470 states and 592 transitions. [2020-11-07 04:50:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:50:41,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2020-11-07 04:50:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:41,308 INFO L225 Difference]: With dead ends: 470 [2020-11-07 04:50:41,308 INFO L226 Difference]: Without dead ends: 461 [2020-11-07 04:50:41,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:50:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2020-11-07 04:50:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2020-11-07 04:50:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-11-07 04:50:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 558 transitions. [2020-11-07 04:50:41,446 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 558 transitions. Word has length 234 [2020-11-07 04:50:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:41,446 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 558 transitions. [2020-11-07 04:50:41,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:50:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 558 transitions. [2020-11-07 04:50:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-07 04:50:41,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:41,448 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-11-07 04:50:41,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-11-07 04:50:41,448 INFO L429 AbstractCegarLoop]: === Iteration 53 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:41,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:41,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1646971217, now seen corresponding path program 1 times [2020-11-07 04:50:41,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:41,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [184141916] [2020-11-07 04:50:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:41,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:41,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:41,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:41,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:41,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:41,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-11-07 04:50:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2020-11-07 04:50:41,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [184141916] [2020-11-07 04:50:41,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:41,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 04:50:41,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744625854] [2020-11-07 04:50:41,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:50:41,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:41,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:50:41,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:50:41,622 INFO L87 Difference]: Start difference. First operand 447 states and 558 transitions. Second operand 7 states. [2020-11-07 04:50:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:42,626 INFO L93 Difference]: Finished difference Result 454 states and 564 transitions. [2020-11-07 04:50:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 04:50:42,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 236 [2020-11-07 04:50:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:42,630 INFO L225 Difference]: With dead ends: 454 [2020-11-07 04:50:42,631 INFO L226 Difference]: Without dead ends: 441 [2020-11-07 04:50:42,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-11-07 04:50:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-11-07 04:50:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-11-07 04:50:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 550 transitions. [2020-11-07 04:50:42,774 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 550 transitions. Word has length 236 [2020-11-07 04:50:42,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:42,774 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 550 transitions. [2020-11-07 04:50:42,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:50:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 550 transitions. [2020-11-07 04:50:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-07 04:50:42,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:42,776 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:42,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-07 04:50:42,776 INFO L429 AbstractCegarLoop]: === Iteration 54 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:42,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1615315333, now seen corresponding path program 1 times [2020-11-07 04:50:42,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:42,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1511237922] [2020-11-07 04:50:42,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:42,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:42,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:42,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-07 04:50:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:42,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-11-07 04:50:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:42,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 04:50:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:42,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-11-07 04:50:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2020-11-07 04:50:43,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1511237922] [2020-11-07 04:50:43,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:43,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 04:50:43,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741838288] [2020-11-07 04:50:43,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:50:43,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:43,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:50:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:50:43,013 INFO L87 Difference]: Start difference. First operand 441 states and 550 transitions. Second operand 6 states. [2020-11-07 04:50:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:43,837 INFO L93 Difference]: Finished difference Result 701 states and 878 transitions. [2020-11-07 04:50:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:50:43,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2020-11-07 04:50:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:43,843 INFO L225 Difference]: With dead ends: 701 [2020-11-07 04:50:43,843 INFO L226 Difference]: Without dead ends: 289 [2020-11-07 04:50:43,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-11-07 04:50:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 272. [2020-11-07 04:50:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-11-07 04:50:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 336 transitions. [2020-11-07 04:50:43,943 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 336 transitions. Word has length 239 [2020-11-07 04:50:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:43,943 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 336 transitions. [2020-11-07 04:50:43,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:50:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 336 transitions. [2020-11-07 04:50:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-11-07 04:50:43,945 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:43,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:43,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-11-07 04:50:43,946 INFO L429 AbstractCegarLoop]: === Iteration 55 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1727576548, now seen corresponding path program 1 times [2020-11-07 04:50:43,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:43,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [87587490] [2020-11-07 04:50:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:44,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:44,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:44,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:44,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:44,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:44,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-11-07 04:50:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-11-07 04:50:44,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [87587490] [2020-11-07 04:50:44,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:50:44,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 04:50:44,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547681662] [2020-11-07 04:50:44,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:50:44,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:44,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:50:44,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:50:44,223 INFO L87 Difference]: Start difference. First operand 272 states and 336 transitions. Second operand 9 states. [2020-11-07 04:50:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:45,549 INFO L93 Difference]: Finished difference Result 327 states and 399 transitions. [2020-11-07 04:50:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:50:45,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2020-11-07 04:50:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:45,556 INFO L225 Difference]: With dead ends: 327 [2020-11-07 04:50:45,556 INFO L226 Difference]: Without dead ends: 307 [2020-11-07 04:50:45,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:50:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-11-07 04:50:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 278. [2020-11-07 04:50:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-11-07 04:50:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2020-11-07 04:50:45,708 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 245 [2020-11-07 04:50:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:45,708 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2020-11-07 04:50:45,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:50:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2020-11-07 04:50:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-11-07 04:50:45,712 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:45,712 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, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:45,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-11-07 04:50:45,712 INFO L429 AbstractCegarLoop]: === Iteration 56 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash -685351208, now seen corresponding path program 1 times [2020-11-07 04:50:45,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:45,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [581415349] [2020-11-07 04:50:45,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:45,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2020-11-07 04:50:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-11-07 04:50:46,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [581415349] [2020-11-07 04:50:46,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:46,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:50:46,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117296935] [2020-11-07 04:50:46,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:50:46,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:46,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:50:46,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:50:46,086 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand 10 states. [2020-11-07 04:50:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:47,845 INFO L93 Difference]: Finished difference Result 338 states and 409 transitions. [2020-11-07 04:50:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 04:50:47,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2020-11-07 04:50:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:47,848 INFO L225 Difference]: With dead ends: 338 [2020-11-07 04:50:47,848 INFO L226 Difference]: Without dead ends: 325 [2020-11-07 04:50:47,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:50:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-11-07 04:50:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 317. [2020-11-07 04:50:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-11-07 04:50:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 388 transitions. [2020-11-07 04:50:47,984 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 388 transitions. Word has length 249 [2020-11-07 04:50:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:47,984 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 388 transitions. [2020-11-07 04:50:47,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:50:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 388 transitions. [2020-11-07 04:50:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-07 04:50:47,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:47,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:47,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-11-07 04:50:47,987 INFO L429 AbstractCegarLoop]: === Iteration 57 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1548901098, now seen corresponding path program 1 times [2020-11-07 04:50:47,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:47,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2056777089] [2020-11-07 04:50:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-11-07 04:50:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2020-11-07 04:50:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-11-07 04:50:48,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2056777089] [2020-11-07 04:50:48,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:48,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:50:48,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228005299] [2020-11-07 04:50:48,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:50:48,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:48,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:50:48,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:48,315 INFO L87 Difference]: Start difference. First operand 317 states and 388 transitions. Second operand 11 states. [2020-11-07 04:50:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:50,433 INFO L93 Difference]: Finished difference Result 330 states and 400 transitions. [2020-11-07 04:50:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:50:50,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 252 [2020-11-07 04:50:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:50,436 INFO L225 Difference]: With dead ends: 330 [2020-11-07 04:50:50,436 INFO L226 Difference]: Without dead ends: 303 [2020-11-07 04:50:50,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:50:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-11-07 04:50:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 274. [2020-11-07 04:50:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2020-11-07 04:50:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 311 transitions. [2020-11-07 04:50:50,516 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 311 transitions. Word has length 252 [2020-11-07 04:50:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:50,517 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 311 transitions. [2020-11-07 04:50:50,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:50:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 311 transitions. [2020-11-07 04:50:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-11-07 04:50:50,518 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:50,518 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, 1, 1, 1, 1, 1] [2020-11-07 04:50:50,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-11-07 04:50:50,518 INFO L429 AbstractCegarLoop]: === Iteration 58 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1452667500, now seen corresponding path program 2 times [2020-11-07 04:50:50,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:50,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [892446653] [2020-11-07 04:50:50,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-11-07 04:50:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-11-07 04:50:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2020-11-07 04:50:50,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [892446653] [2020-11-07 04:50:50,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:50,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 04:50:50,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098675275] [2020-11-07 04:50:50,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 04:50:50,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:50,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 04:50:50,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-07 04:50:50,912 INFO L87 Difference]: Start difference. First operand 274 states and 311 transitions. Second operand 11 states. [2020-11-07 04:50:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:52,476 INFO L93 Difference]: Finished difference Result 343 states and 388 transitions. [2020-11-07 04:50:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 04:50:52,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 253 [2020-11-07 04:50:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:52,478 INFO L225 Difference]: With dead ends: 343 [2020-11-07 04:50:52,478 INFO L226 Difference]: Without dead ends: 277 [2020-11-07 04:50:52,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:50:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-11-07 04:50:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2020-11-07 04:50:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-11-07 04:50:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 314 transitions. [2020-11-07 04:50:52,591 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 314 transitions. Word has length 253 [2020-11-07 04:50:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:52,592 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 314 transitions. [2020-11-07 04:50:52,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 04:50:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 314 transitions. [2020-11-07 04:50:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-11-07 04:50:52,593 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:52,593 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, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:52,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-11-07 04:50:52,593 INFO L429 AbstractCegarLoop]: === Iteration 59 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash 61920203, now seen corresponding path program 1 times [2020-11-07 04:50:52,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:52,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1268840011] [2020-11-07 04:50:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:52,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:52,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:52,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:52,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:52,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 04:50:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:52,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-11-07 04:50:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-11-07 04:50:53,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1268840011] [2020-11-07 04:50:53,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:53,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 04:50:53,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234874044] [2020-11-07 04:50:53,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 04:50:53,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 04:50:53,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-11-07 04:50:53,234 INFO L87 Difference]: Start difference. First operand 277 states and 314 transitions. Second operand 15 states. [2020-11-07 04:50:55,202 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-11-07 04:50:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:56,011 INFO L93 Difference]: Finished difference Result 334 states and 376 transitions. [2020-11-07 04:50:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 04:50:56,012 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 254 [2020-11-07 04:50:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:56,014 INFO L225 Difference]: With dead ends: 334 [2020-11-07 04:50:56,014 INFO L226 Difference]: Without dead ends: 321 [2020-11-07 04:50:56,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2020-11-07 04:50:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-11-07 04:50:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 313. [2020-11-07 04:50:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-11-07 04:50:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 355 transitions. [2020-11-07 04:50:56,125 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 355 transitions. Word has length 254 [2020-11-07 04:50:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:56,126 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 355 transitions. [2020-11-07 04:50:56,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 04:50:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 355 transitions. [2020-11-07 04:50:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-11-07 04:50:56,127 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:56,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:56,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-11-07 04:50:56,127 INFO L429 AbstractCegarLoop]: === Iteration 60 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:56,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1684077380, now seen corresponding path program 1 times [2020-11-07 04:50:56,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:56,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [367806367] [2020-11-07 04:50:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 04:50:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2020-11-07 04:50:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2020-11-07 04:50:56,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [367806367] [2020-11-07 04:50:56,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:56,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 04:50:56,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404080497] [2020-11-07 04:50:56,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 04:50:56,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:56,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 04:50:56,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:50:56,719 INFO L87 Difference]: Start difference. First operand 313 states and 355 transitions. Second operand 12 states. [2020-11-07 04:50:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:50:58,849 INFO L93 Difference]: Finished difference Result 326 states and 367 transitions. [2020-11-07 04:50:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 04:50:58,850 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 255 [2020-11-07 04:50:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:50:58,851 INFO L225 Difference]: With dead ends: 326 [2020-11-07 04:50:58,851 INFO L226 Difference]: Without dead ends: 284 [2020-11-07 04:50:58,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:50:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-11-07 04:50:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2020-11-07 04:50:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-11-07 04:50:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 313 transitions. [2020-11-07 04:50:58,956 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 313 transitions. Word has length 255 [2020-11-07 04:50:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:50:58,957 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 313 transitions. [2020-11-07 04:50:58,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 04:50:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 313 transitions. [2020-11-07 04:50:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-11-07 04:50:58,958 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:50:58,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:50:58,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-11-07 04:50:58,959 INFO L429 AbstractCegarLoop]: === Iteration 61 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:50:58,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:50:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1598956265, now seen corresponding path program 1 times [2020-11-07 04:50:58,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:50:58,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284432662] [2020-11-07 04:50:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:50:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:50:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 04:50:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 04:50:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 04:50:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 04:50:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-11-07 04:50:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:50:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2020-11-07 04:50:59,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284432662] [2020-11-07 04:50:59,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:50:59,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 04:50:59,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715841975] [2020-11-07 04:50:59,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 04:50:59,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:50:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 04:50:59,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:50:59,563 INFO L87 Difference]: Start difference. First operand 277 states and 313 transitions. Second operand 13 states. [2020-11-07 04:51:01,816 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-11-07 04:51:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:02,189 INFO L93 Difference]: Finished difference Result 277 states and 313 transitions. [2020-11-07 04:51:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 04:51:02,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 257 [2020-11-07 04:51:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:02,191 INFO L225 Difference]: With dead ends: 277 [2020-11-07 04:51:02,192 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 04:51:02,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2020-11-07 04:51:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 04:51:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 04:51:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 04:51:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 04:51:02,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2020-11-07 04:51:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:02,194 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 04:51:02,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 04:51:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 04:51:02,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 04:51:02,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-11-07 04:51:02,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 04:51:02,667 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 35 [2020-11-07 04:51:02,809 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 35 [2020-11-07 04:51:02,955 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2020-11-07 04:51:03,328 WARN L194 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2020-11-07 04:51:03,700 WARN L194 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-11-07 04:51:04,283 WARN L194 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 35 [2020-11-07 04:51:04,548 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 35 [2020-11-07 04:51:05,214 WARN L194 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 35 [2020-11-07 04:51:05,491 WARN L194 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 35 [2020-11-07 04:51:05,766 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 35 [2020-11-07 04:51:06,109 WARN L194 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 35 [2020-11-07 04:51:06,299 WARN L194 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-11-07 04:51:06,569 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 35 [2020-11-07 04:51:06,828 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-11-07 04:51:07,059 WARN L194 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-11-07 04:51:07,379 WARN L194 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 35 [2020-11-07 04:51:07,491 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 35 [2020-11-07 04:51:07,827 WARN L194 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 35 [2020-11-07 04:51:08,098 WARN L194 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 35 [2020-11-07 04:51:08,337 WARN L194 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 35 [2020-11-07 04:51:09,096 WARN L194 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 44 [2020-11-07 04:51:10,149 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 263 DAG size of output: 44 [2020-11-07 04:51:19,183 WARN L194 SmtUtils]: Spent 9.03 s on a formula simplification. DAG size of input: 598 DAG size of output: 42 [2020-11-07 04:51:22,881 WARN L194 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 442 DAG size of output: 42 [2020-11-07 04:51:29,624 WARN L194 SmtUtils]: Spent 6.74 s on a formula simplification. DAG size of input: 544 DAG size of output: 42 [2020-11-07 04:52:30,106 WARN L194 SmtUtils]: Spent 1.01 m on a formula simplification. DAG size of input: 1646 DAG size of output: 1074 [2020-11-07 04:52:30,566 WARN L194 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 44 [2020-11-07 04:53:06,410 WARN L194 SmtUtils]: Spent 35.84 s on a formula simplification. DAG size of input: 1313 DAG size of output: 728 [2020-11-07 04:54:42,323 WARN L194 SmtUtils]: Spent 1.60 m on a formula simplification. DAG size of input: 1315 DAG size of output: 49 [2020-11-07 04:55:03,166 WARN L194 SmtUtils]: Spent 20.84 s on a formula simplification. DAG size of input: 771 DAG size of output: 45 [2020-11-07 04:55:03,300 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 44 [2020-11-07 04:55:05,030 WARN L194 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 348 DAG size of output: 42 [2020-11-07 04:55:06,346 WARN L194 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 305 DAG size of output: 44 [2020-11-07 04:56:26,199 WARN L194 SmtUtils]: Spent 1.33 m on a formula simplification. DAG size of input: 1247 DAG size of output: 44 [2020-11-07 04:56:58,613 WARN L194 SmtUtils]: Spent 32.41 s on a formula simplification. DAG size of input: 897 DAG size of output: 45 [2020-11-07 04:57:52,263 WARN L194 SmtUtils]: Spent 53.65 s on a formula simplification. DAG size of input: 1101 DAG size of output: 45 [2020-11-07 04:59:34,473 WARN L194 SmtUtils]: Spent 1.70 m on a formula simplification. DAG size of input: 1288 DAG size of output: 44 [2020-11-07 05:00:11,720 WARN L194 SmtUtils]: Spent 37.24 s on a formula simplification. DAG size of input: 1313 DAG size of output: 728 [2020-11-07 05:00:24,050 WARN L194 SmtUtils]: Spent 12.32 s on a formula simplification. DAG size of input: 654 DAG size of output: 42 [2020-11-07 05:00:48,098 WARN L194 SmtUtils]: Spent 24.04 s on a formula simplification. DAG size of input: 833 DAG size of output: 45