/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_5a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:35:16,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:35:16,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:35:16,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:35:16,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:35:16,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:35:16,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:35:16,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:35:16,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:35:16,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:35:16,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:35:16,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:35:16,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:35:16,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:35:16,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:35:16,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:35:16,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:35:16,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:35:16,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:35:16,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:35:16,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:35:16,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:35:16,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:35:16,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:35:16,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:35:16,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:35:16,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:35:16,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:35:16,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:35:16,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:35:16,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:35:16,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:35:16,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:35:16,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:35:16,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:35:16,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:35:16,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:35:16,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:35:16,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:35:16,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:35:16,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:35:16,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:35:16,259 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:35:16,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:35:16,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:35:16,264 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:35:16,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:35:16,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:35:16,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:35:16,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:35:16,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:35:16,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:35:16,267 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:35:16,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:35:16,268 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:35:16,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:35:16,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:35:16,269 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:35:16,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:35:16,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:35:16,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:35:16,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:35:16,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:35:16,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:35:16,271 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-10-24 00:35:16,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:35:16,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:35:16,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:35:16,750 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:35:16,751 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:35:16,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2020-10-24 00:35:16,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e9633fe/2050cdbc86b441b7ab06d3668bb56a40/FLAGd672b21d2 [2020-10-24 00:35:17,423 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:35:17,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2020-10-24 00:35:17,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e9633fe/2050cdbc86b441b7ab06d3668bb56a40/FLAGd672b21d2 [2020-10-24 00:35:17,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e9633fe/2050cdbc86b441b7ab06d3668bb56a40 [2020-10-24 00:35:17,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:35:17,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:35:17,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:35:17,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:35:17,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:35:17,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:35:17" (1/1) ... [2020-10-24 00:35:17,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42584668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:17, skipping insertion in model container [2020-10-24 00:35:17,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:35:17" (1/1) ... [2020-10-24 00:35:17,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:35:17,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:35:18,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:35:18,059 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:35:18,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:35:18,137 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:35:18,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18 WrapperNode [2020-10-24 00:35:18,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:35:18,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:35:18,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:35:18,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:35:18,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18" (1/1) ... [2020-10-24 00:35:18,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18" (1/1) ... [2020-10-24 00:35:18,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18" (1/1) ... [2020-10-24 00:35:18,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18" (1/1) ... [2020-10-24 00:35:18,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18" (1/1) ... [2020-10-24 00:35:18,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18" (1/1) ... [2020-10-24 00:35:18,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18" (1/1) ... [2020-10-24 00:35:18,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:35:18,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:35:18,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:35:18,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:35:18,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18" (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-10-24 00:35:18,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:35:18,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:35:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:35:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 00:35:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2020-10-24 00:35:18,291 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2020-10-24 00:35:18,291 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2020-10-24 00:35:18,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:35:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:35:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:35:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:35:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:35:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-10-24 00:35:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-10-24 00:35:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 00:35:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2020-10-24 00:35:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2020-10-24 00:35:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2020-10-24 00:35:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:35:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:35:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:35:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:35:18,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:35:18,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:35:18,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:35:19,105 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:35:19,106 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-10-24 00:35:19,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:35:19 BoogieIcfgContainer [2020-10-24 00:35:19,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:35:19,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:35:19,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:35:19,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:35:19,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:35:17" (1/3) ... [2020-10-24 00:35:19,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d159192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:35:19, skipping insertion in model container [2020-10-24 00:35:19,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:18" (2/3) ... [2020-10-24 00:35:19,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d159192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:35:19, skipping insertion in model container [2020-10-24 00:35:19,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:35:19" (3/3) ... [2020-10-24 00:35:19,117 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2020-10-24 00:35:19,128 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:35:19,133 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:35:19,144 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:35:19,166 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:35:19,166 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:35:19,166 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:35:19,166 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:35:19,167 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:35:19,167 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:35:19,167 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:35:19,167 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:35:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-24 00:35:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-10-24 00:35:19,203 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:19,204 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-10-24 00:35:19,204 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash -415784909, now seen corresponding path program 1 times [2020-10-24 00:35:19,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:19,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416653242] [2020-10-24 00:35:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-10-24 00:35:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-10-24 00:35:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-10-24 00:35:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-10-24 00:35:19,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416653242] [2020-10-24 00:35:19,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:35:19,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:35:19,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018730535] [2020-10-24 00:35:19,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:35:19,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:19,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:35:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:35:19,663 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 4 states. [2020-10-24 00:35:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:20,236 INFO L93 Difference]: Finished difference Result 266 states and 323 transitions. [2020-10-24 00:35:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:35:20,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2020-10-24 00:35:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:20,251 INFO L225 Difference]: With dead ends: 266 [2020-10-24 00:35:20,251 INFO L226 Difference]: Without dead ends: 135 [2020-10-24 00:35:20,256 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-10-24 00:35:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-24 00:35:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-10-24 00:35:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-24 00:35:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2020-10-24 00:35:20,333 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 109 [2020-10-24 00:35:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:20,335 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2020-10-24 00:35:20,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:35:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2020-10-24 00:35:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-10-24 00:35:20,339 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:20,339 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-10-24 00:35:20,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:35:20,340 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:20,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:20,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2075471796, now seen corresponding path program 1 times [2020-10-24 00:35:20,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:20,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1749517675] [2020-10-24 00:35:20,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-10-24 00:35:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-10-24 00:35:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-10-24 00:35:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-10-24 00:35:20,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1749517675] [2020-10-24 00:35:20,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:35:20,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-24 00:35:20,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212700307] [2020-10-24 00:35:20,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 00:35:20,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:20,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 00:35:20,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:35:20,553 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 5 states. [2020-10-24 00:35:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:21,030 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2020-10-24 00:35:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 00:35:21,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2020-10-24 00:35:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:21,034 INFO L225 Difference]: With dead ends: 152 [2020-10-24 00:35:21,034 INFO L226 Difference]: Without dead ends: 134 [2020-10-24 00:35:21,036 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-10-24 00:35:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-24 00:35:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-10-24 00:35:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-24 00:35:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2020-10-24 00:35:21,064 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 111 [2020-10-24 00:35:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:21,065 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2020-10-24 00:35:21,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 00:35:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2020-10-24 00:35:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-10-24 00:35:21,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:21,067 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-10-24 00:35:21,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:35:21,068 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:21,068 INFO L82 PathProgramCache]: Analyzing trace with hash 37781676, now seen corresponding path program 1 times [2020-10-24 00:35:21,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:21,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1381269249] [2020-10-24 00:35:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-10-24 00:35:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-10-24 00:35:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-10-24 00:35:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:21,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1381269249] [2020-10-24 00:35:21,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:21,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 00:35:21,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005701866] [2020-10-24 00:35:21,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 00:35:21,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:21,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 00:35:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:35:21,227 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand 5 states. [2020-10-24 00:35:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:21,744 INFO L93 Difference]: Finished difference Result 273 states and 320 transitions. [2020-10-24 00:35:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:35:21,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2020-10-24 00:35:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:21,748 INFO L225 Difference]: With dead ends: 273 [2020-10-24 00:35:21,749 INFO L226 Difference]: Without dead ends: 175 [2020-10-24 00:35:21,750 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-10-24 00:35:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-10-24 00:35:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2020-10-24 00:35:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-24 00:35:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2020-10-24 00:35:21,786 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 111 [2020-10-24 00:35:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:21,786 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2020-10-24 00:35:21,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 00:35:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2020-10-24 00:35:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-10-24 00:35:21,789 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:21,789 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-10-24 00:35:21,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:35:21,789 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:21,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1061811624, now seen corresponding path program 1 times [2020-10-24 00:35:21,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:21,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1404584901] [2020-10-24 00:35:21,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-24 00:35:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-24 00:35:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-24 00:35:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:21,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1404584901] [2020-10-24 00:35:21,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:21,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 00:35:21,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658617095] [2020-10-24 00:35:21,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 00:35:21,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:21,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 00:35:21,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:35:21,999 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 5 states. [2020-10-24 00:35:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:22,659 INFO L93 Difference]: Finished difference Result 284 states and 333 transitions. [2020-10-24 00:35:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 00:35:22,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-10-24 00:35:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:22,663 INFO L225 Difference]: With dead ends: 284 [2020-10-24 00:35:22,663 INFO L226 Difference]: Without dead ends: 176 [2020-10-24 00:35:22,665 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-10-24 00:35:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-24 00:35:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-10-24 00:35:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-24 00:35:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2020-10-24 00:35:22,706 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 114 [2020-10-24 00:35:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:22,711 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2020-10-24 00:35:22,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 00:35:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2020-10-24 00:35:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-10-24 00:35:22,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:22,714 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-10-24 00:35:22,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:35:22,714 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash -503903925, now seen corresponding path program 1 times [2020-10-24 00:35:22,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:22,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [974483790] [2020-10-24 00:35:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 00:35:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 00:35:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-10-24 00:35:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:22,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [974483790] [2020-10-24 00:35:22,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:22,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 00:35:22,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712271651] [2020-10-24 00:35:22,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:35:22,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:22,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:35:22,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:35:22,854 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand 6 states. [2020-10-24 00:35:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:23,555 INFO L93 Difference]: Finished difference Result 320 states and 377 transitions. [2020-10-24 00:35:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:35:23,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-10-24 00:35:23,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:23,559 INFO L225 Difference]: With dead ends: 320 [2020-10-24 00:35:23,559 INFO L226 Difference]: Without dead ends: 199 [2020-10-24 00:35:23,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:35:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-10-24 00:35:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2020-10-24 00:35:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-24 00:35:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 209 transitions. [2020-10-24 00:35:23,603 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 209 transitions. Word has length 119 [2020-10-24 00:35:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:23,605 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 209 transitions. [2020-10-24 00:35:23,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:35:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 209 transitions. [2020-10-24 00:35:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-10-24 00:35:23,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:23,608 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-10-24 00:35:23,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:35:23,609 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:23,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:23,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1598599897, now seen corresponding path program 1 times [2020-10-24 00:35:23,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:23,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720578253] [2020-10-24 00:35:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:23,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:23,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:23,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:23,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 00:35:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:23,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-24 00:35:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:23,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-10-24 00:35:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:23,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720578253] [2020-10-24 00:35:23,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:23,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 00:35:23,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807542865] [2020-10-24 00:35:23,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:35:23,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:23,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:35:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:35:23,806 INFO L87 Difference]: Start difference. First operand 180 states and 209 transitions. Second operand 6 states. [2020-10-24 00:35:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:24,505 INFO L93 Difference]: Finished difference Result 320 states and 377 transitions. [2020-10-24 00:35:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:35:24,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-10-24 00:35:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:24,514 INFO L225 Difference]: With dead ends: 320 [2020-10-24 00:35:24,514 INFO L226 Difference]: Without dead ends: 201 [2020-10-24 00:35:24,515 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-10-24 00:35:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-24 00:35:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2020-10-24 00:35:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-24 00:35:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2020-10-24 00:35:24,558 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 119 [2020-10-24 00:35:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:24,559 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2020-10-24 00:35:24,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:35:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2020-10-24 00:35:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-10-24 00:35:24,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:24,561 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-10-24 00:35:24,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:35:24,561 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:24,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:24,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1705231240, now seen corresponding path program 2 times [2020-10-24 00:35:24,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:24,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [813106552] [2020-10-24 00:35:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-10-24 00:35:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:35:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-10-24 00:35:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:24,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [813106552] [2020-10-24 00:35:24,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:24,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:35:24,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275929784] [2020-10-24 00:35:24,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:35:24,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:24,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:35:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:35:24,771 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 7 states. [2020-10-24 00:35:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:25,492 INFO L93 Difference]: Finished difference Result 354 states and 418 transitions. [2020-10-24 00:35:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:35:25,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-10-24 00:35:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:25,495 INFO L225 Difference]: With dead ends: 354 [2020-10-24 00:35:25,496 INFO L226 Difference]: Without dead ends: 225 [2020-10-24 00:35:25,498 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-10-24 00:35:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-10-24 00:35:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 193. [2020-10-24 00:35:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-10-24 00:35:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2020-10-24 00:35:25,541 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 124 [2020-10-24 00:35:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:25,541 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2020-10-24 00:35:25,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:35:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2020-10-24 00:35:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-10-24 00:35:25,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:25,547 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-10-24 00:35:25,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:35:25,547 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash -487232234, now seen corresponding path program 1 times [2020-10-24 00:35:25,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:25,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [915399915] [2020-10-24 00:35:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-10-24 00:35:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:35:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-10-24 00:35:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:25,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [915399915] [2020-10-24 00:35:25,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:25,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:35:25,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053914688] [2020-10-24 00:35:25,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:35:25,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:35:25,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:35:25,806 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 7 states. [2020-10-24 00:35:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:26,721 INFO L93 Difference]: Finished difference Result 348 states and 412 transitions. [2020-10-24 00:35:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:35:26,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-10-24 00:35:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:26,724 INFO L225 Difference]: With dead ends: 348 [2020-10-24 00:35:26,724 INFO L226 Difference]: Without dead ends: 221 [2020-10-24 00:35:26,729 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-10-24 00:35:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-24 00:35:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2020-10-24 00:35:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-10-24 00:35:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2020-10-24 00:35:26,772 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 124 [2020-10-24 00:35:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:26,773 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2020-10-24 00:35:26,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:35:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2020-10-24 00:35:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-24 00:35:26,775 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:26,775 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-10-24 00:35:26,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:35:26,776 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:26,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash 452126571, now seen corresponding path program 3 times [2020-10-24 00:35:26,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:26,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76849896] [2020-10-24 00:35:26,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:26,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:26,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:26,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:26,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-10-24 00:35:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:26,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-10-24 00:35:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:26,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-24 00:35:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:26,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76849896] [2020-10-24 00:35:26,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:26,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:35:26,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555870244] [2020-10-24 00:35:26,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:35:26,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:26,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:35:26,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:35:26,941 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 8 states. [2020-10-24 00:35:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:28,001 INFO L93 Difference]: Finished difference Result 381 states and 451 transitions. [2020-10-24 00:35:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:35:28,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2020-10-24 00:35:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:28,004 INFO L225 Difference]: With dead ends: 381 [2020-10-24 00:35:28,004 INFO L226 Difference]: Without dead ends: 247 [2020-10-24 00:35:28,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:35:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-10-24 00:35:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 203. [2020-10-24 00:35:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-10-24 00:35:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2020-10-24 00:35:28,040 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 129 [2020-10-24 00:35:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:28,041 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2020-10-24 00:35:28,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:35:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2020-10-24 00:35:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-24 00:35:28,043 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:28,043 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-10-24 00:35:28,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:35:28,044 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:28,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1740336903, now seen corresponding path program 2 times [2020-10-24 00:35:28,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:28,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1182968831] [2020-10-24 00:35:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-10-24 00:35:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-10-24 00:35:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-24 00:35:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:28,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1182968831] [2020-10-24 00:35:28,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:28,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:35:28,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214848] [2020-10-24 00:35:28,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:35:28,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:28,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:35:28,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:35:28,275 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand 8 states. [2020-10-24 00:35:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:29,219 INFO L93 Difference]: Finished difference Result 367 states and 437 transitions. [2020-10-24 00:35:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:35:29,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2020-10-24 00:35:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:29,222 INFO L225 Difference]: With dead ends: 367 [2020-10-24 00:35:29,222 INFO L226 Difference]: Without dead ends: 235 [2020-10-24 00:35:29,224 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-10-24 00:35:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-10-24 00:35:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2020-10-24 00:35:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-10-24 00:35:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2020-10-24 00:35:29,260 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 129 [2020-10-24 00:35:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:29,260 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2020-10-24 00:35:29,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:35:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2020-10-24 00:35:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-24 00:35:29,263 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:29,263 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-10-24 00:35:29,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:35:29,263 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1677870744, now seen corresponding path program 4 times [2020-10-24 00:35:29,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:29,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171522710] [2020-10-24 00:35:29,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:29,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:29,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:29,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:29,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 00:35:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:29,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 00:35:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:29,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-10-24 00:35:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:29,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171522710] [2020-10-24 00:35:29,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:29,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:35:29,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589562744] [2020-10-24 00:35:29,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:35:29,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:29,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:35:29,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:35:29,504 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand 9 states. [2020-10-24 00:35:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:30,583 INFO L93 Difference]: Finished difference Result 408 states and 484 transitions. [2020-10-24 00:35:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:35:30,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-10-24 00:35:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:30,591 INFO L225 Difference]: With dead ends: 408 [2020-10-24 00:35:30,591 INFO L226 Difference]: Without dead ends: 269 [2020-10-24 00:35:30,593 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-10-24 00:35:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-10-24 00:35:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 213. [2020-10-24 00:35:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-10-24 00:35:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2020-10-24 00:35:30,642 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 134 [2020-10-24 00:35:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:30,643 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2020-10-24 00:35:30,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:35:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2020-10-24 00:35:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-24 00:35:30,646 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:30,646 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-10-24 00:35:30,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:35:30,646 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:30,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:30,647 INFO L82 PathProgramCache]: Analyzing trace with hash 424633078, now seen corresponding path program 3 times [2020-10-24 00:35:30,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:30,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263482016] [2020-10-24 00:35:30,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 00:35:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 00:35:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-10-24 00:35:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:30,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263482016] [2020-10-24 00:35:30,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:30,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:35:30,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734068369] [2020-10-24 00:35:30,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:35:30,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:30,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:35:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:35:30,902 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand 9 states. [2020-10-24 00:35:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:32,045 INFO L93 Difference]: Finished difference Result 386 states and 462 transitions. [2020-10-24 00:35:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:35:32,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-10-24 00:35:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:32,049 INFO L225 Difference]: With dead ends: 386 [2020-10-24 00:35:32,049 INFO L226 Difference]: Without dead ends: 249 [2020-10-24 00:35:32,053 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-10-24 00:35:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-10-24 00:35:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 213. [2020-10-24 00:35:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-10-24 00:35:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2020-10-24 00:35:32,100 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 134 [2020-10-24 00:35:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:32,101 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2020-10-24 00:35:32,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:35:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2020-10-24 00:35:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-10-24 00:35:32,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:32,104 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-10-24 00:35:32,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:35:32,105 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:32,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2050515573, now seen corresponding path program 5 times [2020-10-24 00:35:32,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:32,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28220936] [2020-10-24 00:35:32,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-10-24 00:35:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-10-24 00:35:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-24 00:35:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:32,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28220936] [2020-10-24 00:35:32,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:32,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:35:32,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504404283] [2020-10-24 00:35:32,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:35:32,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:32,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:35:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:35:32,305 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand 10 states. [2020-10-24 00:35:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:33,593 INFO L93 Difference]: Finished difference Result 435 states and 517 transitions. [2020-10-24 00:35:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:35:33,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2020-10-24 00:35:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:33,598 INFO L225 Difference]: With dead ends: 435 [2020-10-24 00:35:33,598 INFO L226 Difference]: Without dead ends: 291 [2020-10-24 00:35:33,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=184, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:35:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-10-24 00:35:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2020-10-24 00:35:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-10-24 00:35:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2020-10-24 00:35:33,639 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 139 [2020-10-24 00:35:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:33,639 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2020-10-24 00:35:33,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:35:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2020-10-24 00:35:33,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-10-24 00:35:33,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:33,641 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-10-24 00:35:33,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:35:33,641 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:33,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:33,642 INFO L82 PathProgramCache]: Analyzing trace with hash 51988249, now seen corresponding path program 4 times [2020-10-24 00:35:33,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:33,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607819236] [2020-10-24 00:35:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:33,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:33,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:33,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:33,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-10-24 00:35:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:33,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-10-24 00:35:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:33,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-24 00:35:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:33,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607819236] [2020-10-24 00:35:33,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:33,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:35:33,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535903837] [2020-10-24 00:35:33,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:35:33,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:33,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:35:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:35:33,892 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 10 states. [2020-10-24 00:35:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:35,293 INFO L93 Difference]: Finished difference Result 405 states and 487 transitions. [2020-10-24 00:35:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:35:35,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2020-10-24 00:35:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:35,296 INFO L225 Difference]: With dead ends: 405 [2020-10-24 00:35:35,296 INFO L226 Difference]: Without dead ends: 263 [2020-10-24 00:35:35,298 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-10-24 00:35:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-10-24 00:35:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 223. [2020-10-24 00:35:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-10-24 00:35:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2020-10-24 00:35:35,336 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 139 [2020-10-24 00:35:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:35,337 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2020-10-24 00:35:35,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:35:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2020-10-24 00:35:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-24 00:35:35,339 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:35,339 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-10-24 00:35:35,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:35:35,339 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:35,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:35,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1639590072, now seen corresponding path program 6 times [2020-10-24 00:35:35,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:35,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349050111] [2020-10-24 00:35:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:35,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:35,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:35,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:35,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-10-24 00:35:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:35,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 00:35:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:35,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-10-24 00:35:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 99 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:35,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349050111] [2020-10-24 00:35:35,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:35,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:35:35,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616863951] [2020-10-24 00:35:35,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:35:35,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:35,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:35:35,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:35:35,586 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 11 states. [2020-10-24 00:35:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:36,870 INFO L93 Difference]: Finished difference Result 462 states and 550 transitions. [2020-10-24 00:35:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:35:36,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2020-10-24 00:35:36,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:36,875 INFO L225 Difference]: With dead ends: 462 [2020-10-24 00:35:36,875 INFO L226 Difference]: Without dead ends: 313 [2020-10-24 00:35:36,879 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-10-24 00:35:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-10-24 00:35:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 233. [2020-10-24 00:35:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-10-24 00:35:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2020-10-24 00:35:36,929 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 144 [2020-10-24 00:35:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:36,929 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2020-10-24 00:35:36,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:35:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2020-10-24 00:35:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-24 00:35:36,931 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:36,931 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-10-24 00:35:36,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:35:36,933 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash 462913750, now seen corresponding path program 5 times [2020-10-24 00:35:36,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:36,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [785626900] [2020-10-24 00:35:36,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:37,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:37,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:37,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:37,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-10-24 00:35:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:37,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 00:35:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:37,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-10-24 00:35:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 7 proven. 89 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:37,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [785626900] [2020-10-24 00:35:37,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:37,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:35:37,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078878159] [2020-10-24 00:35:37,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:35:37,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:37,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:35:37,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:35:37,270 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 11 states. [2020-10-24 00:35:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:38,920 INFO L93 Difference]: Finished difference Result 424 states and 512 transitions. [2020-10-24 00:35:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:35:38,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2020-10-24 00:35:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:38,925 INFO L225 Difference]: With dead ends: 424 [2020-10-24 00:35:38,926 INFO L226 Difference]: Without dead ends: 277 [2020-10-24 00:35:38,928 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-10-24 00:35:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-10-24 00:35:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 233. [2020-10-24 00:35:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-10-24 00:35:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2020-10-24 00:35:38,974 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 144 [2020-10-24 00:35:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:38,975 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2020-10-24 00:35:38,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:35:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2020-10-24 00:35:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:35:38,977 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:38,978 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-10-24 00:35:38,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:35:38,978 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1421399125, now seen corresponding path program 7 times [2020-10-24 00:35:38,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:38,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748378902] [2020-10-24 00:35:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:39,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:39,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:39,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:39,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-24 00:35:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:39,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 00:35:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:39,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-10-24 00:35:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 131 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:39,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748378902] [2020-10-24 00:35:39,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:39,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:35:39,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503777678] [2020-10-24 00:35:39,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:35:39,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:39,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:35:39,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:35:39,269 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 12 states. [2020-10-24 00:35:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:40,638 INFO L93 Difference]: Finished difference Result 489 states and 583 transitions. [2020-10-24 00:35:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:35:40,644 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2020-10-24 00:35:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:40,646 INFO L225 Difference]: With dead ends: 489 [2020-10-24 00:35:40,646 INFO L226 Difference]: Without dead ends: 335 [2020-10-24 00:35:40,648 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-10-24 00:35:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-10-24 00:35:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 243. [2020-10-24 00:35:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-24 00:35:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2020-10-24 00:35:40,693 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 149 [2020-10-24 00:35:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:40,693 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2020-10-24 00:35:40,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:35:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2020-10-24 00:35:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:35:40,695 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:40,695 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-10-24 00:35:40,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 00:35:40,696 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:40,696 INFO L82 PathProgramCache]: Analyzing trace with hash 681104697, now seen corresponding path program 6 times [2020-10-24 00:35:40,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:40,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1350386327] [2020-10-24 00:35:40,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:40,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:40,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:40,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:40,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-24 00:35:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:40,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-24 00:35:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:40,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-10-24 00:35:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:40,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1350386327] [2020-10-24 00:35:40,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:40,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:35:40,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978849051] [2020-10-24 00:35:40,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:35:40,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:35:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:35:40,986 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 12 states. [2020-10-24 00:35:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:42,851 INFO L93 Difference]: Finished difference Result 443 states and 537 transitions. [2020-10-24 00:35:42,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:35:42,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2020-10-24 00:35:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:42,863 INFO L225 Difference]: With dead ends: 443 [2020-10-24 00:35:42,863 INFO L226 Difference]: Without dead ends: 291 [2020-10-24 00:35:42,865 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-10-24 00:35:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-10-24 00:35:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 243. [2020-10-24 00:35:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-24 00:35:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2020-10-24 00:35:42,916 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 149 [2020-10-24 00:35:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:42,917 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2020-10-24 00:35:42,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:35:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2020-10-24 00:35:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-10-24 00:35:42,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:42,919 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-10-24 00:35:42,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 00:35:42,919 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1763042008, now seen corresponding path program 8 times [2020-10-24 00:35:42,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:42,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [915630029] [2020-10-24 00:35:42,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:42,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:42,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:42,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-10-24 00:35:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-24 00:35:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-10-24 00:35:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:43,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [915630029] [2020-10-24 00:35:43,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:43,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:35:43,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583079809] [2020-10-24 00:35:43,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:35:43,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:43,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:35:43,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:35:43,207 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 13 states. [2020-10-24 00:35:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:44,935 INFO L93 Difference]: Finished difference Result 516 states and 616 transitions. [2020-10-24 00:35:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:35:44,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2020-10-24 00:35:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:44,937 INFO L225 Difference]: With dead ends: 516 [2020-10-24 00:35:44,938 INFO L226 Difference]: Without dead ends: 357 [2020-10-24 00:35:44,939 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-10-24 00:35:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-10-24 00:35:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 253. [2020-10-24 00:35:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-10-24 00:35:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 303 transitions. [2020-10-24 00:35:44,990 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 303 transitions. Word has length 154 [2020-10-24 00:35:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:44,991 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 303 transitions. [2020-10-24 00:35:44,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:35:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 303 transitions. [2020-10-24 00:35:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-10-24 00:35:44,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:44,993 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-10-24 00:35:44,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 00:35:44,993 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:44,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:44,993 INFO L82 PathProgramCache]: Analyzing trace with hash 339461814, now seen corresponding path program 7 times [2020-10-24 00:35:44,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:44,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739864282] [2020-10-24 00:35:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-10-24 00:35:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-24 00:35:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-10-24 00:35:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 7 proven. 154 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:45,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739864282] [2020-10-24 00:35:45,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:45,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:35:45,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467215943] [2020-10-24 00:35:45,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:35:45,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:45,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:35:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:35:45,376 INFO L87 Difference]: Start difference. First operand 253 states and 303 transitions. Second operand 13 states. [2020-10-24 00:35:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:47,137 INFO L93 Difference]: Finished difference Result 462 states and 562 transitions. [2020-10-24 00:35:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:35:47,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2020-10-24 00:35:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:47,140 INFO L225 Difference]: With dead ends: 462 [2020-10-24 00:35:47,140 INFO L226 Difference]: Without dead ends: 305 [2020-10-24 00:35:47,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:35:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-10-24 00:35:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 253. [2020-10-24 00:35:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-10-24 00:35:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 303 transitions. [2020-10-24 00:35:47,208 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 303 transitions. Word has length 154 [2020-10-24 00:35:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:47,208 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 303 transitions. [2020-10-24 00:35:47,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:35:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 303 transitions. [2020-10-24 00:35:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-10-24 00:35:47,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:47,210 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-10-24 00:35:47,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 00:35:47,211 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1245474357, now seen corresponding path program 9 times [2020-10-24 00:35:47,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:47,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1284738453] [2020-10-24 00:35:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:47,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:47,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:47,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:47,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-24 00:35:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:47,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-10-24 00:35:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:47,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-10-24 00:35:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:47,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1284738453] [2020-10-24 00:35:47,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:47,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:35:47,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884531217] [2020-10-24 00:35:47,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:35:47,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:47,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:35:47,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:35:47,522 INFO L87 Difference]: Start difference. First operand 253 states and 303 transitions. Second operand 14 states. [2020-10-24 00:35:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:49,186 INFO L93 Difference]: Finished difference Result 543 states and 649 transitions. [2020-10-24 00:35:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:35:49,187 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2020-10-24 00:35:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:49,190 INFO L225 Difference]: With dead ends: 543 [2020-10-24 00:35:49,190 INFO L226 Difference]: Without dead ends: 379 [2020-10-24 00:35:49,191 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-10-24 00:35:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-10-24 00:35:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 263. [2020-10-24 00:35:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-10-24 00:35:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-10-24 00:35:49,245 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 159 [2020-10-24 00:35:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:49,245 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-10-24 00:35:49,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:35:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-10-24 00:35:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-10-24 00:35:49,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:49,248 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-10-24 00:35:49,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 00:35:49,248 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash 857029465, now seen corresponding path program 8 times [2020-10-24 00:35:49,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:49,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425935676] [2020-10-24 00:35:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:49,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:49,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:49,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:49,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-24 00:35:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:49,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-10-24 00:35:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:49,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-10-24 00:35:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 7 proven. 194 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:49,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425935676] [2020-10-24 00:35:49,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:49,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:35:49,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213990852] [2020-10-24 00:35:49,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:35:49,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:35:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:35:49,636 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 14 states. [2020-10-24 00:35:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:51,486 INFO L93 Difference]: Finished difference Result 481 states and 587 transitions. [2020-10-24 00:35:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:35:51,489 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2020-10-24 00:35:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:51,491 INFO L225 Difference]: With dead ends: 481 [2020-10-24 00:35:51,491 INFO L226 Difference]: Without dead ends: 319 [2020-10-24 00:35:51,492 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-10-24 00:35:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-10-24 00:35:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 263. [2020-10-24 00:35:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-10-24 00:35:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-10-24 00:35:51,551 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 159 [2020-10-24 00:35:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:51,551 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-10-24 00:35:51,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:35:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-10-24 00:35:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-10-24 00:35:51,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:51,553 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-10-24 00:35:51,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-24 00:35:51,554 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash -19363064, now seen corresponding path program 10 times [2020-10-24 00:35:51,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:51,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [320065286] [2020-10-24 00:35:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:51,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:51,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:51,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:51,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 00:35:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:51,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-10-24 00:35:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:51,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-10-24 00:35:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 6 proven. 257 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:51,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [320065286] [2020-10-24 00:35:51,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:51,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:35:51,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963469479] [2020-10-24 00:35:51,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:35:51,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:35:51,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=118, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:35:51,892 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 15 states. [2020-10-24 00:35:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:54,004 INFO L93 Difference]: Finished difference Result 570 states and 682 transitions. [2020-10-24 00:35:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:35:54,005 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2020-10-24 00:35:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:54,008 INFO L225 Difference]: With dead ends: 570 [2020-10-24 00:35:54,008 INFO L226 Difference]: Without dead ends: 401 [2020-10-24 00:35:54,009 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-10-24 00:35:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2020-10-24 00:35:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 273. [2020-10-24 00:35:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-10-24 00:35:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2020-10-24 00:35:54,076 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 164 [2020-10-24 00:35:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:54,076 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2020-10-24 00:35:54,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:35:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2020-10-24 00:35:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-10-24 00:35:54,078 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:54,078 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-10-24 00:35:54,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-24 00:35:54,078 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:54,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:54,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2083140758, now seen corresponding path program 9 times [2020-10-24 00:35:54,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:54,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763626148] [2020-10-24 00:35:54,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:54,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:54,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:54,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:54,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 00:35:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:54,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-10-24 00:35:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:54,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-10-24 00:35:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 7 proven. 239 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:35:54,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763626148] [2020-10-24 00:35:54,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:54,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:35:54,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232900765] [2020-10-24 00:35:54,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:35:54,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:35:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:35:54,562 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand 15 states. [2020-10-24 00:35:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:57,316 INFO L93 Difference]: Finished difference Result 500 states and 612 transitions. [2020-10-24 00:35:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:35:57,317 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2020-10-24 00:35:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:57,319 INFO L225 Difference]: With dead ends: 500 [2020-10-24 00:35:57,319 INFO L226 Difference]: Without dead ends: 333 [2020-10-24 00:35:57,321 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-10-24 00:35:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-10-24 00:35:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 273. [2020-10-24 00:35:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-10-24 00:35:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2020-10-24 00:35:57,383 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 164 [2020-10-24 00:35:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:57,384 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2020-10-24 00:35:57,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:35:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2020-10-24 00:35:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-24 00:35:57,385 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:57,386 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-10-24 00:35:57,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-24 00:35:57,386 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:57,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1861300245, now seen corresponding path program 11 times [2020-10-24 00:35:57,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:57,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684400219] [2020-10-24 00:35:57,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:35:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:35:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-10-24 00:35:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-10-24 00:35:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-24 00:35:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 6 proven. 309 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:35:57,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684400219] [2020-10-24 00:35:57,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:57,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:35:57,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104970291] [2020-10-24 00:35:57,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:35:57,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:57,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:35:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:35:57,751 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand 16 states. [2020-10-24 00:36:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:00,048 INFO L93 Difference]: Finished difference Result 597 states and 715 transitions. [2020-10-24 00:36:00,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:36:00,052 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2020-10-24 00:36:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:00,056 INFO L225 Difference]: With dead ends: 597 [2020-10-24 00:36:00,056 INFO L226 Difference]: Without dead ends: 423 [2020-10-24 00:36:00,058 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-10-24 00:36:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-24 00:36:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 283. [2020-10-24 00:36:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-10-24 00:36:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 342 transitions. [2020-10-24 00:36:00,127 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 342 transitions. Word has length 169 [2020-10-24 00:36:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:00,128 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 342 transitions. [2020-10-24 00:36:00,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:36:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 342 transitions. [2020-10-24 00:36:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-24 00:36:00,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:00,130 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-10-24 00:36:00,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-24 00:36:00,130 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 241203577, now seen corresponding path program 10 times [2020-10-24 00:36:00,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:00,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1496871475] [2020-10-24 00:36:00,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-10-24 00:36:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-10-24 00:36:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-24 00:36:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 289 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:00,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1496871475] [2020-10-24 00:36:00,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:00,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:36:00,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830248437] [2020-10-24 00:36:00,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:36:00,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:00,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:36:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:36:00,578 INFO L87 Difference]: Start difference. First operand 283 states and 342 transitions. Second operand 16 states. [2020-10-24 00:36:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:02,942 INFO L93 Difference]: Finished difference Result 519 states and 637 transitions. [2020-10-24 00:36:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:36:02,943 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2020-10-24 00:36:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:02,946 INFO L225 Difference]: With dead ends: 519 [2020-10-24 00:36:02,946 INFO L226 Difference]: Without dead ends: 347 [2020-10-24 00:36:02,948 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-10-24 00:36:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-10-24 00:36:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 283. [2020-10-24 00:36:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-10-24 00:36:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 342 transitions. [2020-10-24 00:36:03,017 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 342 transitions. Word has length 169 [2020-10-24 00:36:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:03,018 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 342 transitions. [2020-10-24 00:36:03,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:36:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 342 transitions. [2020-10-24 00:36:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-10-24 00:36:03,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:03,020 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-10-24 00:36:03,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-24 00:36:03,020 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2105483496, now seen corresponding path program 12 times [2020-10-24 00:36:03,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:03,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1996034557] [2020-10-24 00:36:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-10-24 00:36:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-10-24 00:36:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-10-24 00:36:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 366 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:03,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1996034557] [2020-10-24 00:36:03,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:03,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:36:03,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68909409] [2020-10-24 00:36:03,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:36:03,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:03,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:36:03,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=151, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:36:03,404 INFO L87 Difference]: Start difference. First operand 283 states and 342 transitions. Second operand 17 states. [2020-10-24 00:36:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:05,891 INFO L93 Difference]: Finished difference Result 624 states and 748 transitions. [2020-10-24 00:36:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:36:05,892 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2020-10-24 00:36:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:05,895 INFO L225 Difference]: With dead ends: 624 [2020-10-24 00:36:05,895 INFO L226 Difference]: Without dead ends: 445 [2020-10-24 00:36:05,896 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-10-24 00:36:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-24 00:36:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 293. [2020-10-24 00:36:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-10-24 00:36:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 355 transitions. [2020-10-24 00:36:05,971 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 355 transitions. Word has length 174 [2020-10-24 00:36:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:05,972 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 355 transitions. [2020-10-24 00:36:05,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:36:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2020-10-24 00:36:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-10-24 00:36:05,974 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:05,974 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-10-24 00:36:05,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-24 00:36:05,974 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:05,975 INFO L82 PathProgramCache]: Analyzing trace with hash -86979978, now seen corresponding path program 11 times [2020-10-24 00:36:05,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:05,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [958837009] [2020-10-24 00:36:05,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-10-24 00:36:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-10-24 00:36:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-10-24 00:36:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 7 proven. 344 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:06,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [958837009] [2020-10-24 00:36:06,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:06,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:36:06,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975012259] [2020-10-24 00:36:06,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:36:06,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:06,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:36:06,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:36:06,488 INFO L87 Difference]: Start difference. First operand 293 states and 355 transitions. Second operand 17 states. [2020-10-24 00:36:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:09,213 INFO L93 Difference]: Finished difference Result 538 states and 662 transitions. [2020-10-24 00:36:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:36:09,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2020-10-24 00:36:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:09,215 INFO L225 Difference]: With dead ends: 538 [2020-10-24 00:36:09,215 INFO L226 Difference]: Without dead ends: 361 [2020-10-24 00:36:09,217 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-10-24 00:36:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-10-24 00:36:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 293. [2020-10-24 00:36:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-10-24 00:36:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 355 transitions. [2020-10-24 00:36:09,291 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 355 transitions. Word has length 174 [2020-10-24 00:36:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:09,292 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 355 transitions. [2020-10-24 00:36:09,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:36:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2020-10-24 00:36:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-24 00:36:09,294 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:09,294 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-10-24 00:36:09,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-24 00:36:09,295 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash 175826443, now seen corresponding path program 13 times [2020-10-24 00:36:09,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:09,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1066164838] [2020-10-24 00:36:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-10-24 00:36:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-10-24 00:36:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-24 00:36:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 6 proven. 428 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:09,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1066164838] [2020-10-24 00:36:09,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:09,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:36:09,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095493341] [2020-10-24 00:36:09,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:36:09,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:36:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=169, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:36:09,707 INFO L87 Difference]: Start difference. First operand 293 states and 355 transitions. Second operand 18 states. [2020-10-24 00:36:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:11,634 INFO L93 Difference]: Finished difference Result 651 states and 781 transitions. [2020-10-24 00:36:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:36:11,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2020-10-24 00:36:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:11,637 INFO L225 Difference]: With dead ends: 651 [2020-10-24 00:36:11,637 INFO L226 Difference]: Without dead ends: 467 [2020-10-24 00:36:11,638 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-10-24 00:36:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-10-24 00:36:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 303. [2020-10-24 00:36:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-10-24 00:36:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2020-10-24 00:36:11,722 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 179 [2020-10-24 00:36:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:11,722 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2020-10-24 00:36:11,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:36:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2020-10-24 00:36:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-24 00:36:11,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:11,724 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-10-24 00:36:11,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-24 00:36:11,725 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:11,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2016637031, now seen corresponding path program 12 times [2020-10-24 00:36:11,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:11,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [895774399] [2020-10-24 00:36:11,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:11,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-10-24 00:36:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-10-24 00:36:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-24 00:36:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 7 proven. 404 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:12,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [895774399] [2020-10-24 00:36:12,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:12,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:36:12,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360827499] [2020-10-24 00:36:12,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:36:12,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:36:12,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:36:12,302 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 18 states. [2020-10-24 00:36:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:16,175 INFO L93 Difference]: Finished difference Result 557 states and 687 transitions. [2020-10-24 00:36:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:36:16,181 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2020-10-24 00:36:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:16,182 INFO L225 Difference]: With dead ends: 557 [2020-10-24 00:36:16,182 INFO L226 Difference]: Without dead ends: 375 [2020-10-24 00:36:16,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 00:36:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-10-24 00:36:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 303. [2020-10-24 00:36:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-10-24 00:36:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2020-10-24 00:36:16,265 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 179 [2020-10-24 00:36:16,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:16,265 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2020-10-24 00:36:16,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:36:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2020-10-24 00:36:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-24 00:36:16,267 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:16,267 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-10-24 00:36:16,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-24 00:36:16,268 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:16,268 INFO L82 PathProgramCache]: Analyzing trace with hash -926163256, now seen corresponding path program 14 times [2020-10-24 00:36:16,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:16,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [165300859] [2020-10-24 00:36:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-10-24 00:36:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-24 00:36:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-24 00:36:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 6 proven. 495 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:16,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [165300859] [2020-10-24 00:36:16,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:16,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 00:36:16,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012257376] [2020-10-24 00:36:16,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 00:36:16,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:16,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 00:36:16,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=188, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:36:16,721 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 19 states. [2020-10-24 00:36:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:19,687 INFO L93 Difference]: Finished difference Result 678 states and 814 transitions. [2020-10-24 00:36:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:36:19,692 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2020-10-24 00:36:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:19,695 INFO L225 Difference]: With dead ends: 678 [2020-10-24 00:36:19,695 INFO L226 Difference]: Without dead ends: 489 [2020-10-24 00:36:19,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=491, Invalid=769, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 00:36:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-10-24 00:36:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 313. [2020-10-24 00:36:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-24 00:36:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 381 transitions. [2020-10-24 00:36:19,784 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 381 transitions. Word has length 184 [2020-10-24 00:36:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:19,784 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 381 transitions. [2020-10-24 00:36:19,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 00:36:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 381 transitions. [2020-10-24 00:36:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-24 00:36:19,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:19,787 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-10-24 00:36:19,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-24 00:36:19,787 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:19,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:19,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1176340566, now seen corresponding path program 13 times [2020-10-24 00:36:19,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:19,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400246485] [2020-10-24 00:36:19,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:19,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-10-24 00:36:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-24 00:36:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-24 00:36:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 7 proven. 469 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:20,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400246485] [2020-10-24 00:36:20,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:20,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 00:36:20,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678802789] [2020-10-24 00:36:20,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 00:36:20,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 00:36:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:36:20,378 INFO L87 Difference]: Start difference. First operand 313 states and 381 transitions. Second operand 19 states. [2020-10-24 00:36:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:24,061 INFO L93 Difference]: Finished difference Result 576 states and 712 transitions. [2020-10-24 00:36:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:36:24,064 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2020-10-24 00:36:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:24,066 INFO L225 Difference]: With dead ends: 576 [2020-10-24 00:36:24,066 INFO L226 Difference]: Without dead ends: 389 [2020-10-24 00:36:24,068 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-10-24 00:36:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-10-24 00:36:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 313. [2020-10-24 00:36:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-24 00:36:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 381 transitions. [2020-10-24 00:36:24,156 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 381 transitions. Word has length 184 [2020-10-24 00:36:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:24,156 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 381 transitions. [2020-10-24 00:36:24,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 00:36:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 381 transitions. [2020-10-24 00:36:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-24 00:36:24,158 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:24,158 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-10-24 00:36:24,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-24 00:36:24,159 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash -254159829, now seen corresponding path program 15 times [2020-10-24 00:36:24,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:24,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1214493521] [2020-10-24 00:36:24,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:36:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-10-24 00:36:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-10-24 00:36:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 6 proven. 567 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:24,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1214493521] [2020-10-24 00:36:24,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:24,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:36:24,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244507542] [2020-10-24 00:36:24,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:36:24,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:24,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:36:24,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=208, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:36:24,641 INFO L87 Difference]: Start difference. First operand 313 states and 381 transitions. Second operand 20 states. [2020-10-24 00:36:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:27,563 INFO L93 Difference]: Finished difference Result 705 states and 847 transitions. [2020-10-24 00:36:27,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 00:36:27,565 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 189 [2020-10-24 00:36:27,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:27,568 INFO L225 Difference]: With dead ends: 705 [2020-10-24 00:36:27,568 INFO L226 Difference]: Without dead ends: 511 [2020-10-24 00:36:27,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=547, Invalid=859, Unknown=0, NotChecked=0, Total=1406 [2020-10-24 00:36:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-10-24 00:36:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 323. [2020-10-24 00:36:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-10-24 00:36:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2020-10-24 00:36:27,681 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 189 [2020-10-24 00:36:27,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:27,682 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2020-10-24 00:36:27,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:36:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2020-10-24 00:36:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-24 00:36:27,684 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:27,684 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-10-24 00:36:27,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-24 00:36:27,684 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:27,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1848343993, now seen corresponding path program 14 times [2020-10-24 00:36:27,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:27,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1363814919] [2020-10-24 00:36:27,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:27,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:28,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:36:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:28,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-10-24 00:36:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:28,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-10-24 00:36:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 7 proven. 539 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:28,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1363814919] [2020-10-24 00:36:28,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:28,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:36:28,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427683168] [2020-10-24 00:36:28,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:36:28,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:36:28,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:36:28,333 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 20 states. [2020-10-24 00:36:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:32,622 INFO L93 Difference]: Finished difference Result 595 states and 737 transitions. [2020-10-24 00:36:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 00:36:32,623 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 189 [2020-10-24 00:36:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:32,625 INFO L225 Difference]: With dead ends: 595 [2020-10-24 00:36:32,625 INFO L226 Difference]: Without dead ends: 403 [2020-10-24 00:36:32,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406 [2020-10-24 00:36:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2020-10-24 00:36:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 323. [2020-10-24 00:36:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-10-24 00:36:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2020-10-24 00:36:32,722 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 189 [2020-10-24 00:36:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:32,722 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2020-10-24 00:36:32,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:36:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2020-10-24 00:36:32,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-24 00:36:32,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:32,724 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-10-24 00:36:32,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-24 00:36:32,725 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:32,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2060663640, now seen corresponding path program 16 times [2020-10-24 00:36:32,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:32,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [748449159] [2020-10-24 00:36:32,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:32,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:32,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:32,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:33,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-24 00:36:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:33,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-10-24 00:36:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:33,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-10-24 00:36:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 6 proven. 644 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:33,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [748449159] [2020-10-24 00:36:33,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:33,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-10-24 00:36:33,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727625490] [2020-10-24 00:36:33,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 00:36:33,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:33,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 00:36:33,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=229, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:36:33,247 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 21 states. [2020-10-24 00:36:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:36,614 INFO L93 Difference]: Finished difference Result 732 states and 880 transitions. [2020-10-24 00:36:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:36:36,615 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2020-10-24 00:36:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:36,617 INFO L225 Difference]: With dead ends: 732 [2020-10-24 00:36:36,617 INFO L226 Difference]: Without dead ends: 533 [2020-10-24 00:36:36,619 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-10-24 00:36:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-24 00:36:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 333. [2020-10-24 00:36:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-10-24 00:36:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 407 transitions. [2020-10-24 00:36:36,720 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 407 transitions. Word has length 194 [2020-10-24 00:36:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:36,721 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 407 transitions. [2020-10-24 00:36:36,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 00:36:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 407 transitions. [2020-10-24 00:36:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-24 00:36:36,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:36,723 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-10-24 00:36:36,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-24 00:36:36,723 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash 41840182, now seen corresponding path program 15 times [2020-10-24 00:36:36,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:36,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [614527183] [2020-10-24 00:36:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:36,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:36,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:36,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:37,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-24 00:36:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:37,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-10-24 00:36:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:37,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-10-24 00:36:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 7 proven. 614 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:37,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [614527183] [2020-10-24 00:36:37,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:37,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-10-24 00:36:37,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469659231] [2020-10-24 00:36:37,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 00:36:37,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 00:36:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:36:37,432 INFO L87 Difference]: Start difference. First operand 333 states and 407 transitions. Second operand 21 states. [2020-10-24 00:36:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:41,489 INFO L93 Difference]: Finished difference Result 614 states and 762 transitions. [2020-10-24 00:36:41,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:36:41,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2020-10-24 00:36:41,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:41,494 INFO L225 Difference]: With dead ends: 614 [2020-10-24 00:36:41,494 INFO L226 Difference]: Without dead ends: 417 [2020-10-24 00:36:41,495 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-10-24 00:36:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-10-24 00:36:41,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 333. [2020-10-24 00:36:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-10-24 00:36:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 407 transitions. [2020-10-24 00:36:41,605 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 407 transitions. Word has length 194 [2020-10-24 00:36:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:41,605 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 407 transitions. [2020-10-24 00:36:41,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 00:36:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 407 transitions. [2020-10-24 00:36:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-10-24 00:36:41,607 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:41,607 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-10-24 00:36:41,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-24 00:36:41,608 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash 880646731, now seen corresponding path program 17 times [2020-10-24 00:36:41,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:41,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1117001931] [2020-10-24 00:36:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:41,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:41,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:41,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:42,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-10-24 00:36:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:42,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-10-24 00:36:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:42,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-10-24 00:36:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 6 proven. 726 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:42,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1117001931] [2020-10-24 00:36:42,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:42,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 00:36:42,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475361365] [2020-10-24 00:36:42,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 00:36:42,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:42,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 00:36:42,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=251, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:36:42,231 INFO L87 Difference]: Start difference. First operand 333 states and 407 transitions. Second operand 22 states. [2020-10-24 00:36:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:45,629 INFO L93 Difference]: Finished difference Result 759 states and 913 transitions. [2020-10-24 00:36:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:36:45,633 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 199 [2020-10-24 00:36:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:45,637 INFO L225 Difference]: With dead ends: 759 [2020-10-24 00:36:45,637 INFO L226 Difference]: Without dead ends: 555 [2020-10-24 00:36:45,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=668, Invalid=1054, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 00:36:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-10-24 00:36:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 343. [2020-10-24 00:36:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-10-24 00:36:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2020-10-24 00:36:45,746 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 199 [2020-10-24 00:36:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:45,746 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2020-10-24 00:36:45,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 00:36:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2020-10-24 00:36:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-10-24 00:36:45,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:45,748 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-10-24 00:36:45,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-24 00:36:45,749 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1311816743, now seen corresponding path program 16 times [2020-10-24 00:36:45,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:45,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552439546] [2020-10-24 00:36:45,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:45,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:45,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:45,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:46,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-10-24 00:36:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:46,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-10-24 00:36:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:46,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-10-24 00:36:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 7 proven. 694 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:46,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552439546] [2020-10-24 00:36:46,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:46,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 00:36:46,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577498719] [2020-10-24 00:36:46,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 00:36:46,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:46,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 00:36:46,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:36:46,465 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand 22 states. [2020-10-24 00:36:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:52,144 INFO L93 Difference]: Finished difference Result 633 states and 787 transitions. [2020-10-24 00:36:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:36:52,145 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 199 [2020-10-24 00:36:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:52,147 INFO L225 Difference]: With dead ends: 633 [2020-10-24 00:36:52,147 INFO L226 Difference]: Without dead ends: 431 [2020-10-24 00:36:52,149 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-10-24 00:36:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-24 00:36:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 343. [2020-10-24 00:36:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-10-24 00:36:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2020-10-24 00:36:52,248 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 199 [2020-10-24 00:36:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:52,248 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2020-10-24 00:36:52,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 00:36:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2020-10-24 00:36:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-10-24 00:36:52,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:52,250 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-10-24 00:36:52,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-24 00:36:52,251 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash 630182536, now seen corresponding path program 18 times [2020-10-24 00:36:52,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:52,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1375268201] [2020-10-24 00:36:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:52,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:52,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:52,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:52,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-10-24 00:36:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:52,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-24 00:36:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:52,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-10-24 00:36:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 6 proven. 813 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:36:52,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1375268201] [2020-10-24 00:36:52,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:52,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 00:36:52,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204102790] [2020-10-24 00:36:52,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 00:36:52,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 00:36:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:36:52,927 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand 23 states. [2020-10-24 00:36:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:55,398 INFO L93 Difference]: Finished difference Result 786 states and 946 transitions. [2020-10-24 00:36:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-24 00:36:55,399 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 204 [2020-10-24 00:36:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:55,402 INFO L225 Difference]: With dead ends: 786 [2020-10-24 00:36:55,402 INFO L226 Difference]: Without dead ends: 577 [2020-10-24 00:36:55,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=733, Invalid=1159, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 00:36:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2020-10-24 00:36:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 353. [2020-10-24 00:36:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-10-24 00:36:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2020-10-24 00:36:55,509 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 204 [2020-10-24 00:36:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:55,510 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2020-10-24 00:36:55,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 00:36:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2020-10-24 00:36:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-10-24 00:36:55,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:55,512 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-10-24 00:36:55,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-24 00:36:55,512 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:55,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:55,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1562280938, now seen corresponding path program 17 times [2020-10-24 00:36:55,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:55,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296139039] [2020-10-24 00:36:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:55,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:55,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:55,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:36:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:56,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-10-24 00:36:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:56,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-24 00:36:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:56,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-10-24 00:36:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 7 proven. 779 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:36:56,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296139039] [2020-10-24 00:36:56,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:56,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 00:36:56,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315315399] [2020-10-24 00:36:56,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 00:36:56,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:56,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 00:36:56,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:36:56,291 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand 23 states. [2020-10-24 00:37:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:02,411 INFO L93 Difference]: Finished difference Result 652 states and 812 transitions. [2020-10-24 00:37:02,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-24 00:37:02,419 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 204 [2020-10-24 00:37:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:02,421 INFO L225 Difference]: With dead ends: 652 [2020-10-24 00:37:02,421 INFO L226 Difference]: Without dead ends: 445 [2020-10-24 00:37:02,422 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-10-24 00:37:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-24 00:37:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 353. [2020-10-24 00:37:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-10-24 00:37:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2020-10-24 00:37:02,538 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 204 [2020-10-24 00:37:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:02,538 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2020-10-24 00:37:02,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 00:37:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2020-10-24 00:37:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-10-24 00:37:02,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:02,541 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-10-24 00:37:02,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-24 00:37:02,541 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:02,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:02,541 INFO L82 PathProgramCache]: Analyzing trace with hash 121124971, now seen corresponding path program 19 times [2020-10-24 00:37:02,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:02,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [611821668] [2020-10-24 00:37:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:02,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:02,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:02,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:03,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-10-24 00:37:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:03,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-10-24 00:37:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:03,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-10-24 00:37:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 6 proven. 905 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:03,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [611821668] [2020-10-24 00:37:03,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:03,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:37:03,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577138748] [2020-10-24 00:37:03,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:37:03,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:37:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=298, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:37:03,199 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand 24 states. [2020-10-24 00:37:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:06,219 INFO L93 Difference]: Finished difference Result 813 states and 979 transitions. [2020-10-24 00:37:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:37:06,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 209 [2020-10-24 00:37:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:06,229 INFO L225 Difference]: With dead ends: 813 [2020-10-24 00:37:06,230 INFO L226 Difference]: Without dead ends: 599 [2020-10-24 00:37:06,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=801, Invalid=1269, Unknown=0, NotChecked=0, Total=2070 [2020-10-24 00:37:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-10-24 00:37:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 363. [2020-10-24 00:37:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-10-24 00:37:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 446 transitions. [2020-10-24 00:37:06,354 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 446 transitions. Word has length 209 [2020-10-24 00:37:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:06,355 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 446 transitions. [2020-10-24 00:37:06,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:37:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 446 transitions. [2020-10-24 00:37:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-10-24 00:37:06,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:06,357 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-10-24 00:37:06,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-24 00:37:06,357 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2071338503, now seen corresponding path program 18 times [2020-10-24 00:37:06,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:06,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1359179147] [2020-10-24 00:37:06,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:06,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:06,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:06,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:07,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-10-24 00:37:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:07,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-10-24 00:37:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:07,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-10-24 00:37:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 7 proven. 869 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:07,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1359179147] [2020-10-24 00:37:07,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:07,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:37:07,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5686459] [2020-10-24 00:37:07,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:37:07,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:07,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:37:07,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:37:07,241 INFO L87 Difference]: Start difference. First operand 363 states and 446 transitions. Second operand 24 states. [2020-10-24 00:37:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:13,845 INFO L93 Difference]: Finished difference Result 671 states and 837 transitions. [2020-10-24 00:37:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:37:13,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 209 [2020-10-24 00:37:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:13,848 INFO L225 Difference]: With dead ends: 671 [2020-10-24 00:37:13,848 INFO L226 Difference]: Without dead ends: 459 [2020-10-24 00:37:13,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=288, Invalid=1782, Unknown=0, NotChecked=0, Total=2070 [2020-10-24 00:37:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-10-24 00:37:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 363. [2020-10-24 00:37:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-10-24 00:37:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 446 transitions. [2020-10-24 00:37:13,971 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 446 transitions. Word has length 209 [2020-10-24 00:37:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:13,972 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 446 transitions. [2020-10-24 00:37:13,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:37:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 446 transitions. [2020-10-24 00:37:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-10-24 00:37:13,973 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:13,974 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-10-24 00:37:13,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-24 00:37:13,974 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:13,974 INFO L82 PathProgramCache]: Analyzing trace with hash -882702232, now seen corresponding path program 20 times [2020-10-24 00:37:13,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:13,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448537565] [2020-10-24 00:37:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:14,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:14,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:14,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:14,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-24 00:37:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:14,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-10-24 00:37:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:14,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-10-24 00:37:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 6 proven. 1002 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:14,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448537565] [2020-10-24 00:37:14,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:14,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 00:37:14,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916202342] [2020-10-24 00:37:14,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 00:37:14,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 00:37:14,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=323, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:37:14,691 INFO L87 Difference]: Start difference. First operand 363 states and 446 transitions. Second operand 25 states. [2020-10-24 00:37:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:17,779 INFO L93 Difference]: Finished difference Result 840 states and 1012 transitions. [2020-10-24 00:37:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 00:37:17,780 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2020-10-24 00:37:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:17,783 INFO L225 Difference]: With dead ends: 840 [2020-10-24 00:37:17,783 INFO L226 Difference]: Without dead ends: 621 [2020-10-24 00:37:17,785 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-10-24 00:37:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-10-24 00:37:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 373. [2020-10-24 00:37:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-24 00:37:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 459 transitions. [2020-10-24 00:37:17,896 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 459 transitions. Word has length 214 [2020-10-24 00:37:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:17,897 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 459 transitions. [2020-10-24 00:37:17,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 00:37:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 459 transitions. [2020-10-24 00:37:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-10-24 00:37:17,898 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:17,899 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-10-24 00:37:17,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-24 00:37:17,899 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:17,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:17,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1219801590, now seen corresponding path program 19 times [2020-10-24 00:37:17,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:17,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242450969] [2020-10-24 00:37:17,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:17,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:17,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:17,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:18,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-24 00:37:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:18,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-10-24 00:37:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:18,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-10-24 00:37:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 7 proven. 964 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:18,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242450969] [2020-10-24 00:37:18,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:18,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 00:37:18,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972949405] [2020-10-24 00:37:18,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 00:37:18,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 00:37:18,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:37:18,922 INFO L87 Difference]: Start difference. First operand 373 states and 459 transitions. Second operand 25 states. [2020-10-24 00:37:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:24,619 INFO L93 Difference]: Finished difference Result 690 states and 862 transitions. [2020-10-24 00:37:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 00:37:24,621 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2020-10-24 00:37:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:24,623 INFO L225 Difference]: With dead ends: 690 [2020-10-24 00:37:24,623 INFO L226 Difference]: Without dead ends: 473 [2020-10-24 00:37:24,624 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-10-24 00:37:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-10-24 00:37:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 373. [2020-10-24 00:37:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-24 00:37:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 459 transitions. [2020-10-24 00:37:24,735 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 459 transitions. Word has length 214 [2020-10-24 00:37:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:24,735 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 459 transitions. [2020-10-24 00:37:24,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 00:37:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 459 transitions. [2020-10-24 00:37:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-10-24 00:37:24,737 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:24,737 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-10-24 00:37:24,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-10-24 00:37:24,738 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:24,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash -61100405, now seen corresponding path program 21 times [2020-10-24 00:37:24,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:24,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1307804792] [2020-10-24 00:37:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:24,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:24,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:24,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:25,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-10-24 00:37:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:25,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-10-24 00:37:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:25,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-10-24 00:37:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 6 proven. 1104 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:25,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1307804792] [2020-10-24 00:37:25,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:25,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 00:37:25,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701717364] [2020-10-24 00:37:25,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 00:37:25,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 00:37:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=349, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:37:25,481 INFO L87 Difference]: Start difference. First operand 373 states and 459 transitions. Second operand 26 states. [2020-10-24 00:37:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:29,480 INFO L93 Difference]: Finished difference Result 867 states and 1045 transitions. [2020-10-24 00:37:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:37:29,480 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 219 [2020-10-24 00:37:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:29,484 INFO L225 Difference]: With dead ends: 867 [2020-10-24 00:37:29,484 INFO L226 Difference]: Without dead ends: 643 [2020-10-24 00:37:29,485 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-10-24 00:37:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-10-24 00:37:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 383. [2020-10-24 00:37:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-24 00:37:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2020-10-24 00:37:29,580 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 219 [2020-10-24 00:37:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:29,580 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2020-10-24 00:37:29,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 00:37:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2020-10-24 00:37:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-10-24 00:37:29,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:29,582 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-10-24 00:37:29,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-10-24 00:37:29,582 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2041403417, now seen corresponding path program 20 times [2020-10-24 00:37:29,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:29,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936991864] [2020-10-24 00:37:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:29,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:29,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:29,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:30,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-10-24 00:37:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:30,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-10-24 00:37:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:30,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-10-24 00:37:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 7 proven. 1064 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:30,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936991864] [2020-10-24 00:37:30,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:30,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 00:37:30,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169955000] [2020-10-24 00:37:30,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 00:37:30,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:30,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 00:37:30,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:37:30,678 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 26 states. [2020-10-24 00:37:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:37,551 INFO L93 Difference]: Finished difference Result 709 states and 887 transitions. [2020-10-24 00:37:37,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:37:37,553 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 219 [2020-10-24 00:37:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:37,555 INFO L225 Difference]: With dead ends: 709 [2020-10-24 00:37:37,556 INFO L226 Difference]: Without dead ends: 487 [2020-10-24 00:37:37,557 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-10-24 00:37:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2020-10-24 00:37:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 383. [2020-10-24 00:37:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-24 00:37:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2020-10-24 00:37:37,692 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 219 [2020-10-24 00:37:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:37,693 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2020-10-24 00:37:37,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 00:37:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2020-10-24 00:37:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-10-24 00:37:37,695 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:37,696 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-10-24 00:37:37,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-10-24 00:37:37,696 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash 647259720, now seen corresponding path program 22 times [2020-10-24 00:37:37,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:37,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536226517] [2020-10-24 00:37:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:37,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:37,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:37,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:38,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-10-24 00:37:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:38,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2020-10-24 00:37:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:38,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-10-24 00:37:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 6 proven. 1211 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:38,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [536226517] [2020-10-24 00:37:38,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:38,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-10-24 00:37:38,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138840019] [2020-10-24 00:37:38,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-24 00:37:38,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:38,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-24 00:37:38,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=376, Unknown=0, NotChecked=0, Total=702 [2020-10-24 00:37:38,513 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand 27 states. [2020-10-24 00:37:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:42,004 INFO L93 Difference]: Finished difference Result 894 states and 1078 transitions. [2020-10-24 00:37:42,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 00:37:42,005 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 224 [2020-10-24 00:37:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:42,008 INFO L225 Difference]: With dead ends: 894 [2020-10-24 00:37:42,009 INFO L226 Difference]: Without dead ends: 665 [2020-10-24 00:37:42,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1023, Invalid=1629, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 00:37:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-10-24 00:37:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 393. [2020-10-24 00:37:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-10-24 00:37:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2020-10-24 00:37:42,104 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 224 [2020-10-24 00:37:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:42,104 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2020-10-24 00:37:42,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-24 00:37:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2020-10-24 00:37:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-10-24 00:37:42,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:42,106 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-10-24 00:37:42,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-24 00:37:42,106 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:42,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:42,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1545203754, now seen corresponding path program 21 times [2020-10-24 00:37:42,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:42,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1508821210] [2020-10-24 00:37:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:42,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:42,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:42,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:43,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-10-24 00:37:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:43,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2020-10-24 00:37:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:43,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-10-24 00:37:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 7 proven. 1169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:43,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1508821210] [2020-10-24 00:37:43,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:43,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-10-24 00:37:43,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69970825] [2020-10-24 00:37:43,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-24 00:37:43,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-24 00:37:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2020-10-24 00:37:43,238 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand 27 states. [2020-10-24 00:37:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:51,714 INFO L93 Difference]: Finished difference Result 728 states and 912 transitions. [2020-10-24 00:37:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 00:37:51,715 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 224 [2020-10-24 00:37:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:51,717 INFO L225 Difference]: With dead ends: 728 [2020-10-24 00:37:51,717 INFO L226 Difference]: Without dead ends: 501 [2020-10-24 00:37:51,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=330, Invalid=2322, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 00:37:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-10-24 00:37:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 393. [2020-10-24 00:37:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-10-24 00:37:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2020-10-24 00:37:51,822 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 224 [2020-10-24 00:37:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:51,822 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2020-10-24 00:37:51,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-24 00:37:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2020-10-24 00:37:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-10-24 00:37:51,824 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:51,824 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-10-24 00:37:51,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-24 00:37:51,824 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash 683277483, now seen corresponding path program 23 times [2020-10-24 00:37:51,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:51,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1593109815] [2020-10-24 00:37:51,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:51,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:51,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:51,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-10-24 00:37:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-10-24 00:37:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-10-24 00:37:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 6 proven. 1323 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:37:52,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1593109815] [2020-10-24 00:37:52,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:52,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 00:37:52,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194524121] [2020-10-24 00:37:52,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 00:37:52,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 00:37:52,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=404, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:37:52,741 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand 28 states. [2020-10-24 00:37:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:56,503 INFO L93 Difference]: Finished difference Result 921 states and 1111 transitions. [2020-10-24 00:37:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 00:37:56,504 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 229 [2020-10-24 00:37:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:56,507 INFO L225 Difference]: With dead ends: 921 [2020-10-24 00:37:56,507 INFO L226 Difference]: Without dead ends: 687 [2020-10-24 00:37:56,509 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-10-24 00:37:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-24 00:37:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 403. [2020-10-24 00:37:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-10-24 00:37:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 498 transitions. [2020-10-24 00:37:56,608 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 498 transitions. Word has length 229 [2020-10-24 00:37:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:56,609 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 498 transitions. [2020-10-24 00:37:56,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 00:37:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 498 transitions. [2020-10-24 00:37:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-10-24 00:37:56,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:56,610 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-10-24 00:37:56,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-24 00:37:56,611 INFO L429 AbstractCegarLoop]: === Iteration 50 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1509185991, now seen corresponding path program 22 times [2020-10-24 00:37:56,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:56,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [572485132] [2020-10-24 00:37:56,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:37:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:37:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-10-24 00:37:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-10-24 00:37:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-10-24 00:37:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 7 proven. 1279 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-24 00:37:57,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [572485132] [2020-10-24 00:37:57,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:57,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 00:37:57,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855886938] [2020-10-24 00:37:57,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 00:37:57,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:57,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 00:37:57,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:37:57,791 INFO L87 Difference]: Start difference. First operand 403 states and 498 transitions. Second operand 28 states. [2020-10-24 00:38:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:06,985 INFO L93 Difference]: Finished difference Result 747 states and 937 transitions. [2020-10-24 00:38:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 00:38:06,990 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 229 [2020-10-24 00:38:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:06,993 INFO L225 Difference]: With dead ends: 747 [2020-10-24 00:38:06,993 INFO L226 Difference]: Without dead ends: 515 [2020-10-24 00:38:06,994 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-10-24 00:38:06,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-10-24 00:38:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 403. [2020-10-24 00:38:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-10-24 00:38:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 498 transitions. [2020-10-24 00:38:07,122 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 498 transitions. Word has length 229 [2020-10-24 00:38:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:07,123 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 498 transitions. [2020-10-24 00:38:07,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 00:38:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 498 transitions. [2020-10-24 00:38:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-10-24 00:38:07,124 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:07,124 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-10-24 00:38:07,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-10-24 00:38:07,124 INFO L429 AbstractCegarLoop]: === Iteration 51 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1435626536, now seen corresponding path program 24 times [2020-10-24 00:38:07,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:07,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [25323450] [2020-10-24 00:38:07,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:07,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:07,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:07,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:07,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:07,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:07,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-10-24 00:38:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 6 proven. 1440 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:38:08,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [25323450] [2020-10-24 00:38:08,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:08,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-10-24 00:38:08,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415601800] [2020-10-24 00:38:08,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-24 00:38:08,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:08,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-24 00:38:08,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=433, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:38:08,050 INFO L87 Difference]: Start difference. First operand 403 states and 498 transitions. Second operand 29 states. [2020-10-24 00:38:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:12,880 INFO L93 Difference]: Finished difference Result 948 states and 1144 transitions. [2020-10-24 00:38:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-24 00:38:12,886 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-10-24 00:38:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:12,890 INFO L225 Difference]: With dead ends: 948 [2020-10-24 00:38:12,890 INFO L226 Difference]: Without dead ends: 709 [2020-10-24 00:38:12,892 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-10-24 00:38:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-10-24 00:38:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 413. [2020-10-24 00:38:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-10-24 00:38:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 511 transitions. [2020-10-24 00:38:13,006 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 511 transitions. Word has length 234 [2020-10-24 00:38:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:13,007 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 511 transitions. [2020-10-24 00:38:13,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-24 00:38:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 511 transitions. [2020-10-24 00:38:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-10-24 00:38:13,009 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:13,009 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-10-24 00:38:13,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-10-24 00:38:13,009 INFO L429 AbstractCegarLoop]: === Iteration 52 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:13,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash -756836938, now seen corresponding path program 23 times [2020-10-24 00:38:13,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:13,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1438954490] [2020-10-24 00:38:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-10-24 00:38:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-10-24 00:38:13,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1438954490] [2020-10-24 00:38:13,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:13,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:38:13,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13685468] [2020-10-24 00:38:13,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:38:13,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:13,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:38:13,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:13,382 INFO L87 Difference]: Start difference. First operand 413 states and 511 transitions. Second operand 11 states. [2020-10-24 00:38:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:15,097 INFO L93 Difference]: Finished difference Result 470 states and 592 transitions. [2020-10-24 00:38:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:38:15,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2020-10-24 00:38:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:15,101 INFO L225 Difference]: With dead ends: 470 [2020-10-24 00:38:15,102 INFO L226 Difference]: Without dead ends: 461 [2020-10-24 00:38:15,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 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-10-24 00:38:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2020-10-24 00:38:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2020-10-24 00:38:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-10-24 00:38:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 558 transitions. [2020-10-24 00:38:15,221 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 558 transitions. Word has length 234 [2020-10-24 00:38:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:15,221 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 558 transitions. [2020-10-24 00:38:15,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:38:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 558 transitions. [2020-10-24 00:38:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-10-24 00:38:15,224 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:15,224 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-10-24 00:38:15,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-10-24 00:38:15,224 INFO L429 AbstractCegarLoop]: === Iteration 53 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1646971217, now seen corresponding path program 1 times [2020-10-24 00:38:15,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:15,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [497171541] [2020-10-24 00:38:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:15,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:15,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:15,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:15,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:15,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:15,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-10-24 00:38:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2020-10-24 00:38:15,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [497171541] [2020-10-24 00:38:15,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:38:15,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 00:38:15,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744651549] [2020-10-24 00:38:15,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:38:15,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:15,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:38:15,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:38:15,379 INFO L87 Difference]: Start difference. First operand 447 states and 558 transitions. Second operand 7 states. [2020-10-24 00:38:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:16,399 INFO L93 Difference]: Finished difference Result 454 states and 564 transitions. [2020-10-24 00:38:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:38:16,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 236 [2020-10-24 00:38:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:16,403 INFO L225 Difference]: With dead ends: 454 [2020-10-24 00:38:16,404 INFO L226 Difference]: Without dead ends: 441 [2020-10-24 00:38:16,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-10-24 00:38:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-10-24 00:38:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-10-24 00:38:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 550 transitions. [2020-10-24 00:38:16,542 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 550 transitions. Word has length 236 [2020-10-24 00:38:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:16,543 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 550 transitions. [2020-10-24 00:38:16,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:38:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 550 transitions. [2020-10-24 00:38:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-10-24 00:38:16,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:16,545 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-10-24 00:38:16,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-24 00:38:16,545 INFO L429 AbstractCegarLoop]: === Iteration 54 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1615315333, now seen corresponding path program 1 times [2020-10-24 00:38:16,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:16,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [446759562] [2020-10-24 00:38:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-24 00:38:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-10-24 00:38:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-10-24 00:38:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-10-24 00:38:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2020-10-24 00:38:16,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [446759562] [2020-10-24 00:38:16,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:16,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 00:38:16,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610174489] [2020-10-24 00:38:16,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:38:16,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:38:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:38:16,763 INFO L87 Difference]: Start difference. First operand 441 states and 550 transitions. Second operand 6 states. [2020-10-24 00:38:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:17,533 INFO L93 Difference]: Finished difference Result 701 states and 878 transitions. [2020-10-24 00:38:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:38:17,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2020-10-24 00:38:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:17,545 INFO L225 Difference]: With dead ends: 701 [2020-10-24 00:38:17,545 INFO L226 Difference]: Without dead ends: 289 [2020-10-24 00:38:17,547 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-10-24 00:38:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-10-24 00:38:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 272. [2020-10-24 00:38:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-10-24 00:38:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 336 transitions. [2020-10-24 00:38:17,675 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 336 transitions. Word has length 239 [2020-10-24 00:38:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:17,675 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 336 transitions. [2020-10-24 00:38:17,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:38:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 336 transitions. [2020-10-24 00:38:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-10-24 00:38:17,677 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:17,678 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-10-24 00:38:17,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-24 00:38:17,678 INFO L429 AbstractCegarLoop]: === Iteration 55 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:17,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1727576548, now seen corresponding path program 1 times [2020-10-24 00:38:17,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:17,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1171165323] [2020-10-24 00:38:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-10-24 00:38:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-10-24 00:38:17,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1171165323] [2020-10-24 00:38:17,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:38:17,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 00:38:17,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111246202] [2020-10-24 00:38:17,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:38:17,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:38:17,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:38:17,996 INFO L87 Difference]: Start difference. First operand 272 states and 336 transitions. Second operand 9 states. [2020-10-24 00:38:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:19,412 INFO L93 Difference]: Finished difference Result 327 states and 399 transitions. [2020-10-24 00:38:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:38:19,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2020-10-24 00:38:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:19,424 INFO L225 Difference]: With dead ends: 327 [2020-10-24 00:38:19,424 INFO L226 Difference]: Without dead ends: 307 [2020-10-24 00:38:19,425 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-10-24 00:38:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-10-24 00:38:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 278. [2020-10-24 00:38:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-10-24 00:38:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2020-10-24 00:38:19,559 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 245 [2020-10-24 00:38:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:19,559 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2020-10-24 00:38:19,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:38:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2020-10-24 00:38:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-10-24 00:38:19,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:19,561 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-10-24 00:38:19,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-24 00:38:19,562 INFO L429 AbstractCegarLoop]: === Iteration 56 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:19,562 INFO L82 PathProgramCache]: Analyzing trace with hash -685351208, now seen corresponding path program 1 times [2020-10-24 00:38:19,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:19,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1229074075] [2020-10-24 00:38:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:19,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2020-10-24 00:38:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1415 trivial. 0 not checked. [2020-10-24 00:38:20,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1229074075] [2020-10-24 00:38:20,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:20,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:38:20,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516649355] [2020-10-24 00:38:20,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:38:20,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:20,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:38:20,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:20,048 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand 11 states. [2020-10-24 00:38:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:22,176 INFO L93 Difference]: Finished difference Result 344 states and 413 transitions. [2020-10-24 00:38:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:38:22,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 249 [2020-10-24 00:38:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:22,178 INFO L225 Difference]: With dead ends: 344 [2020-10-24 00:38:22,178 INFO L226 Difference]: Without dead ends: 281 [2020-10-24 00:38:22,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:38:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-10-24 00:38:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2020-10-24 00:38:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-10-24 00:38:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2020-10-24 00:38:22,277 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 249 [2020-10-24 00:38:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:22,278 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2020-10-24 00:38:22,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:38:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2020-10-24 00:38:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2020-10-24 00:38:22,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:22,279 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:22,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-10-24 00:38:22,279 INFO L429 AbstractCegarLoop]: === Iteration 57 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash -6499881, now seen corresponding path program 1 times [2020-10-24 00:38:22,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:22,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297920634] [2020-10-24 00:38:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:22,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:22,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:22,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:22,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:22,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:22,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-10-24 00:38:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2020-10-24 00:38:22,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297920634] [2020-10-24 00:38:22,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:22,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:38:22,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308032471] [2020-10-24 00:38:22,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:38:22,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:38:22,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:38:22,665 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand 10 states. [2020-10-24 00:38:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:24,763 INFO L93 Difference]: Finished difference Result 341 states and 412 transitions. [2020-10-24 00:38:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:38:24,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 250 [2020-10-24 00:38:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:24,766 INFO L225 Difference]: With dead ends: 341 [2020-10-24 00:38:24,766 INFO L226 Difference]: Without dead ends: 328 [2020-10-24 00:38:24,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:38:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-10-24 00:38:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2020-10-24 00:38:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-10-24 00:38:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 391 transitions. [2020-10-24 00:38:24,995 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 391 transitions. Word has length 250 [2020-10-24 00:38:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:24,996 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 391 transitions. [2020-10-24 00:38:24,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:38:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 391 transitions. [2020-10-24 00:38:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-10-24 00:38:24,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:24,998 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:38:24,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-10-24 00:38:24,999 INFO L429 AbstractCegarLoop]: === Iteration 58 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash 207786891, now seen corresponding path program 1 times [2020-10-24 00:38:24,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:25,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [324147520] [2020-10-24 00:38:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-24 00:38:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-10-24 00:38:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1424 trivial. 0 not checked. [2020-10-24 00:38:25,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [324147520] [2020-10-24 00:38:25,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:25,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:38:25,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489636554] [2020-10-24 00:38:25,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:38:25,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:38:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:25,404 INFO L87 Difference]: Start difference. First operand 320 states and 391 transitions. Second operand 11 states. [2020-10-24 00:38:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:27,918 INFO L93 Difference]: Finished difference Result 333 states and 403 transitions. [2020-10-24 00:38:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:38:27,920 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 253 [2020-10-24 00:38:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:27,924 INFO L225 Difference]: With dead ends: 333 [2020-10-24 00:38:27,924 INFO L226 Difference]: Without dead ends: 306 [2020-10-24 00:38:27,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:38:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-10-24 00:38:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 277. [2020-10-24 00:38:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-10-24 00:38:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 314 transitions. [2020-10-24 00:38:28,039 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 314 transitions. Word has length 253 [2020-10-24 00:38:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:28,040 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 314 transitions. [2020-10-24 00:38:28,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:38:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 314 transitions. [2020-10-24 00:38:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-10-24 00:38:28,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:28,041 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-10-24 00:38:28,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-10-24 00:38:28,041 INFO L429 AbstractCegarLoop]: === Iteration 59 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:28,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1976498843, now seen corresponding path program 1 times [2020-10-24 00:38:28,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:28,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599839570] [2020-10-24 00:38:28,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:38:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 00:38:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 00:38:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-10-24 00:38:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-10-24 00:38:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2020-10-24 00:38:28,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599839570] [2020-10-24 00:38:28,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:28,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:38:28,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817555154] [2020-10-24 00:38:28,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:38:28,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:28,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:38:28,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:38:28,515 INFO L87 Difference]: Start difference. First operand 277 states and 314 transitions. Second operand 10 states. [2020-10-24 00:38:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:30,567 INFO L93 Difference]: Finished difference Result 306 states and 347 transitions. [2020-10-24 00:38:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:38:30,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2020-10-24 00:38:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:30,569 INFO L225 Difference]: With dead ends: 306 [2020-10-24 00:38:30,569 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:38:30,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:38:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:38:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:38:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:38:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:38:30,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2020-10-24 00:38:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:30,573 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:38:30,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:38:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:38:30,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:38:30,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-10-24 00:38:30,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:38:31,182 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-10-24 00:38:31,426 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 35 [2020-10-24 00:38:31,809 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-10-24 00:38:31,946 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 35 [2020-10-24 00:38:32,086 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2020-10-24 00:38:32,459 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 35 [2020-10-24 00:38:33,186 WARN L193 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 35 [2020-10-24 00:38:33,579 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 35 [2020-10-24 00:38:33,929 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2020-10-24 00:38:34,385 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 35 [2020-10-24 00:38:34,930 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 35 [2020-10-24 00:38:35,224 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 35 [2020-10-24 00:38:35,498 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2020-10-24 00:38:35,778 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 35 [2020-10-24 00:38:35,906 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 35 [2020-10-24 00:38:36,312 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 35 [2020-10-24 00:38:36,644 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 35 [2020-10-24 00:38:36,940 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 35 [2020-10-24 00:38:37,221 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 35 [2020-10-24 00:38:37,945 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 44 [2020-10-24 00:39:17,421 WARN L193 SmtUtils]: Spent 39.47 s on a formula simplification. DAG size of input: 1316 DAG size of output: 730 [2020-10-24 00:39:18,376 WARN L193 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 44 [2020-10-24 00:39:28,254 WARN L193 SmtUtils]: Spent 9.87 s on a formula simplification. DAG size of input: 598 DAG size of output: 42 [2020-10-24 00:40:06,568 WARN L193 SmtUtils]: Spent 38.31 s on a formula simplification. DAG size of input: 1316 DAG size of output: 730 [2020-10-24 00:40:10,606 WARN L193 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 442 DAG size of output: 42 [2020-10-24 00:40:17,974 WARN L193 SmtUtils]: Spent 7.36 s on a formula simplification. DAG size of input: 544 DAG size of output: 42 [2020-10-24 00:40:18,426 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 44 [2020-10-24 00:40:40,477 WARN L193 SmtUtils]: Spent 21.99 s on a formula simplification. DAG size of input: 771 DAG size of output: 45 [2020-10-24 00:40:40,613 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 44 [2020-10-24 00:40:42,441 WARN L193 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 348 DAG size of output: 42 [2020-10-24 00:40:43,809 WARN L193 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 305 DAG size of output: 44 [2020-10-24 00:42:05,171 WARN L193 SmtUtils]: Spent 1.36 m on a formula simplification. DAG size of input: 1247 DAG size of output: 44 [2020-10-24 00:42:38,298 WARN L193 SmtUtils]: Spent 33.12 s on a formula simplification. DAG size of input: 897 DAG size of output: 45 [2020-10-24 00:43:16,319 WARN L193 SmtUtils]: Spent 38.02 s on a formula simplification. DAG size of input: 1316 DAG size of output: 730 [2020-10-24 00:44:12,685 WARN L193 SmtUtils]: Spent 56.36 s on a formula simplification. DAG size of input: 1101 DAG size of output: 45 [2020-10-24 00:46:01,706 WARN L193 SmtUtils]: Spent 1.82 m on a formula simplification. DAG size of input: 1288 DAG size of output: 44 [2020-10-24 00:46:14,599 WARN L193 SmtUtils]: Spent 12.89 s on a formula simplification. DAG size of input: 654 DAG size of output: 42 [2020-10-24 00:46:39,149 WARN L193 SmtUtils]: Spent 24.55 s on a formula simplification. DAG size of input: 833 DAG size of output: 45 [2020-10-24 00:47:44,602 WARN L193 SmtUtils]: Spent 1.09 m on a formula simplification. DAG size of input: 1646 DAG size of output: 1074