/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/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:36:32,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:36:32,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:36:32,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:36:32,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:36:32,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:36:32,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:36:32,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:36:32,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:36:32,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:36:32,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:36:32,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:36:32,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:36:32,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:36:32,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:36:32,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:36:32,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:36:32,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:36:32,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:36:32,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:36:32,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:36:32,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:36:32,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:36:32,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:36:32,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:36:32,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:36:32,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:36:32,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:36:32,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:36:32,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:36:32,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:36:32,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:36:32,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:36:32,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:36:32,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:36:32,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:36:32,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:36:32,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:36:32,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:36:32,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:36:32,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:36:32,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:36:32,232 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:36:32,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:36:32,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:36:32,237 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:36:32,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:36:32,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:36:32,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:36:32,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:36:32,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:36:32,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:36:32,239 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:36:32,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:36:32,240 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:36:32,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:36:32,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:36:32,241 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:36:32,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:36:32,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:36:32,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:36:32,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:36:32,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:36:32,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:36:32,242 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:36:32,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:36:32,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:36:32,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:36:32,643 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:36:32,643 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:36:32,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-11-07 06:36:32,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc9dedfa/583eba80f1494adab7d67180ae8b5869/FLAG845e0f1df [2020-11-07 06:36:33,379 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:36:33,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-11-07 06:36:33,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc9dedfa/583eba80f1494adab7d67180ae8b5869/FLAG845e0f1df [2020-11-07 06:36:33,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc9dedfa/583eba80f1494adab7d67180ae8b5869 [2020-11-07 06:36:33,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:36:33,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:36:33,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:36:33,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:36:33,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:36:33,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:36:33" (1/1) ... [2020-11-07 06:36:33,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad0719d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:33, skipping insertion in model container [2020-11-07 06:36:33,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:36:33" (1/1) ... [2020-11-07 06:36:33,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:36:33,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:36:33,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:36:33,964 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:36:34,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:36:34,035 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:36:34,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34 WrapperNode [2020-11-07 06:36:34,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:36:34,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:36:34,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:36:34,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:36:34,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34" (1/1) ... [2020-11-07 06:36:34,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34" (1/1) ... [2020-11-07 06:36:34,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34" (1/1) ... [2020-11-07 06:36:34,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34" (1/1) ... [2020-11-07 06:36:34,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34" (1/1) ... [2020-11-07 06:36:34,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34" (1/1) ... [2020-11-07 06:36:34,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34" (1/1) ... [2020-11-07 06:36:34,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:36:34,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:36:34,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:36:34,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:36:34,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:36:34,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:36:34,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:36:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:36:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:36:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:36:34,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:36:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:36:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:36:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:36:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:36:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:36:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:36:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:36:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:36:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:36:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:36:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:36:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:36:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:36:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:36:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:36:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:36:34,879 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:36:34,880 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 06:36:34,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:36:34 BoogieIcfgContainer [2020-11-07 06:36:34,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:36:34,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:36:34,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:36:34,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:36:34,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:36:33" (1/3) ... [2020-11-07 06:36:34,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b58a3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:36:34, skipping insertion in model container [2020-11-07 06:36:34,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:34" (2/3) ... [2020-11-07 06:36:34,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b58a3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:36:34, skipping insertion in model container [2020-11-07 06:36:34,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:36:34" (3/3) ... [2020-11-07 06:36:34,899 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2020-11-07 06:36:34,914 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:36:34,919 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:36:34,931 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:36:34,966 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:36:34,966 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:36:34,966 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:36:34,966 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:36:34,966 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:36:34,967 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:36:34,967 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:36:34,967 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:36:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-11-07 06:36:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 06:36:34,993 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:34,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:34,995 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:35,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:35,001 INFO L82 PathProgramCache]: Analyzing trace with hash -29193420, now seen corresponding path program 1 times [2020-11-07 06:36:35,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:35,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1260108994] [2020-11-07 06:36:35,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:35,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:36:35,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1260108994] [2020-11-07 06:36:35,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:35,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:36:35,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407394437] [2020-11-07 06:36:35,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:36:35,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:36:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:36:35,360 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 6 states. [2020-11-07 06:36:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:36,459 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2020-11-07 06:36:36,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:36:36,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-11-07 06:36:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:36,480 INFO L225 Difference]: With dead ends: 158 [2020-11-07 06:36:36,481 INFO L226 Difference]: Without dead ends: 90 [2020-11-07 06:36:36,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-07 06:36:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2020-11-07 06:36:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 06:36:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2020-11-07 06:36:36,554 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 34 [2020-11-07 06:36:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:36,555 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2020-11-07 06:36:36,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:36:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2020-11-07 06:36:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 06:36:36,558 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:36,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:36,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:36:36,558 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -864195967, now seen corresponding path program 1 times [2020-11-07 06:36:36,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:36,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347295707] [2020-11-07 06:36:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:36,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:36:36,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347295707] [2020-11-07 06:36:36,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:36,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:36:36,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784300420] [2020-11-07 06:36:36,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:36:36,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:36:36,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:36:36,699 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand 6 states. [2020-11-07 06:36:36,978 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-07 06:36:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:37,313 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2020-11-07 06:36:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:36:37,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-11-07 06:36:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:37,317 INFO L225 Difference]: With dead ends: 96 [2020-11-07 06:36:37,317 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 06:36:37,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 06:36:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2020-11-07 06:36:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-07 06:36:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2020-11-07 06:36:37,348 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 34 [2020-11-07 06:36:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:37,348 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2020-11-07 06:36:37,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:36:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2020-11-07 06:36:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-07 06:36:37,350 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:37,350 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:37,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:36:37,350 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash 908649375, now seen corresponding path program 1 times [2020-11-07 06:36:37,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:37,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1532270944] [2020-11-07 06:36:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:37,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:37,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:36:37,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1532270944] [2020-11-07 06:36:37,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:37,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:36:37,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483597827] [2020-11-07 06:36:37,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:36:37,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:37,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:36:37,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:36:37,484 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 6 states. [2020-11-07 06:36:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:38,087 INFO L93 Difference]: Finished difference Result 127 states and 156 transitions. [2020-11-07 06:36:38,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:36:38,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-11-07 06:36:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:38,091 INFO L225 Difference]: With dead ends: 127 [2020-11-07 06:36:38,091 INFO L226 Difference]: Without dead ends: 123 [2020-11-07 06:36:38,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-07 06:36:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2020-11-07 06:36:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-07 06:36:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2020-11-07 06:36:38,124 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 39 [2020-11-07 06:36:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:38,125 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2020-11-07 06:36:38,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:36:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2020-11-07 06:36:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 06:36:38,126 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:38,127 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:38,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:36:38,127 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:38,128 INFO L82 PathProgramCache]: Analyzing trace with hash -417185567, now seen corresponding path program 1 times [2020-11-07 06:36:38,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:38,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100262632] [2020-11-07 06:36:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:38,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:38,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:38,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:36:38,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100262632] [2020-11-07 06:36:38,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:38,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:36:38,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66081405] [2020-11-07 06:36:38,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:36:38,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:36:38,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:36:38,323 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand 7 states. [2020-11-07 06:36:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:38,895 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2020-11-07 06:36:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:36:38,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-11-07 06:36:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:38,898 INFO L225 Difference]: With dead ends: 117 [2020-11-07 06:36:38,899 INFO L226 Difference]: Without dead ends: 113 [2020-11-07 06:36:38,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:36:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-11-07 06:36:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-11-07 06:36:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-07 06:36:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2020-11-07 06:36:38,956 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 44 [2020-11-07 06:36:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:38,958 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2020-11-07 06:36:38,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:36:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2020-11-07 06:36:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 06:36:38,963 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:38,964 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:38,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:36:38,964 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash -33628526, now seen corresponding path program 1 times [2020-11-07 06:36:38,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:38,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [280757497] [2020-11-07 06:36:38,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:36:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:36:39,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [280757497] [2020-11-07 06:36:39,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:39,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:36:39,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075648149] [2020-11-07 06:36:39,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:36:39,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:39,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:36:39,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:36:39,121 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand 6 states. [2020-11-07 06:36:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:39,725 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2020-11-07 06:36:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:36:39,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-11-07 06:36:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:39,728 INFO L225 Difference]: With dead ends: 146 [2020-11-07 06:36:39,728 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 06:36:39,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 06:36:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2020-11-07 06:36:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 06:36:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2020-11-07 06:36:39,766 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 49 [2020-11-07 06:36:39,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:39,767 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2020-11-07 06:36:39,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:36:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2020-11-07 06:36:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 06:36:39,770 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:39,770 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:39,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:36:39,770 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -478395316, now seen corresponding path program 1 times [2020-11-07 06:36:39,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:39,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1407358556] [2020-11-07 06:36:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:36:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-07 06:36:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:36:39,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1407358556] [2020-11-07 06:36:39,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:39,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:36:39,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17832307] [2020-11-07 06:36:39,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:36:39,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:39,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:36:39,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:36:39,901 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand 8 states. [2020-11-07 06:36:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:40,872 INFO L93 Difference]: Finished difference Result 203 states and 271 transitions. [2020-11-07 06:36:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:36:40,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2020-11-07 06:36:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:40,876 INFO L225 Difference]: With dead ends: 203 [2020-11-07 06:36:40,876 INFO L226 Difference]: Without dead ends: 199 [2020-11-07 06:36:40,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:36:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-11-07 06:36:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2020-11-07 06:36:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-11-07 06:36:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 232 transitions. [2020-11-07 06:36:40,918 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 232 transitions. Word has length 67 [2020-11-07 06:36:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:40,918 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 232 transitions. [2020-11-07 06:36:40,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:36:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 232 transitions. [2020-11-07 06:36:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 06:36:40,920 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:40,921 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:40,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:36:40,921 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:40,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:40,922 INFO L82 PathProgramCache]: Analyzing trace with hash -150378842, now seen corresponding path program 1 times [2020-11-07 06:36:40,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:40,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1017341102] [2020-11-07 06:36:40,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:41,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:41,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:41,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:41,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:41,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:41,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:41,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:36:41,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1017341102] [2020-11-07 06:36:41,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:41,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 06:36:41,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167946061] [2020-11-07 06:36:41,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:36:41,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:36:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:36:41,084 INFO L87 Difference]: Start difference. First operand 174 states and 232 transitions. Second operand 9 states. [2020-11-07 06:36:42,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:42,098 INFO L93 Difference]: Finished difference Result 214 states and 279 transitions. [2020-11-07 06:36:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:36:42,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2020-11-07 06:36:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:42,105 INFO L225 Difference]: With dead ends: 214 [2020-11-07 06:36:42,105 INFO L226 Difference]: Without dead ends: 210 [2020-11-07 06:36:42,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2020-11-07 06:36:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-11-07 06:36:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 191. [2020-11-07 06:36:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-11-07 06:36:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 250 transitions. [2020-11-07 06:36:42,161 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 250 transitions. Word has length 73 [2020-11-07 06:36:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:42,163 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 250 transitions. [2020-11-07 06:36:42,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:36:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2020-11-07 06:36:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 06:36:42,167 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:42,168 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:42,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:36:42,168 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1054405889, now seen corresponding path program 1 times [2020-11-07 06:36:42,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:42,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [565269432] [2020-11-07 06:36:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:42,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:42,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:42,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:42,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:36:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:42,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-07 06:36:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:42,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:42,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:36:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:42,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-11-07 06:36:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-07 06:36:42,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [565269432] [2020-11-07 06:36:42,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:42,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:36:42,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766479825] [2020-11-07 06:36:42,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:36:42,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:36:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:36:42,358 INFO L87 Difference]: Start difference. First operand 191 states and 250 transitions. Second operand 8 states. [2020-11-07 06:36:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:43,298 INFO L93 Difference]: Finished difference Result 236 states and 308 transitions. [2020-11-07 06:36:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:36:43,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2020-11-07 06:36:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:43,309 INFO L225 Difference]: With dead ends: 236 [2020-11-07 06:36:43,309 INFO L226 Difference]: Without dead ends: 232 [2020-11-07 06:36:43,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:36:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-11-07 06:36:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 218. [2020-11-07 06:36:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-11-07 06:36:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2020-11-07 06:36:43,361 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 77 [2020-11-07 06:36:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:43,361 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2020-11-07 06:36:43,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:36:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2020-11-07 06:36:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 06:36:43,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:43,364 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:43,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:36:43,364 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash -801092115, now seen corresponding path program 1 times [2020-11-07 06:36:43,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:43,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [454056186] [2020-11-07 06:36:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:43,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:43,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:43,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:43,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:43,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:43,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:43,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:43,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:36:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-07 06:36:43,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [454056186] [2020-11-07 06:36:43,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:43,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:36:43,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690440657] [2020-11-07 06:36:43,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:36:43,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:36:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:36:43,499 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand 8 states. [2020-11-07 06:36:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:44,304 INFO L93 Difference]: Finished difference Result 234 states and 308 transitions. [2020-11-07 06:36:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:36:44,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2020-11-07 06:36:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:44,309 INFO L225 Difference]: With dead ends: 234 [2020-11-07 06:36:44,309 INFO L226 Difference]: Without dead ends: 230 [2020-11-07 06:36:44,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:36:44,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-11-07 06:36:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2020-11-07 06:36:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-11-07 06:36:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 295 transitions. [2020-11-07 06:36:44,361 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 295 transitions. Word has length 78 [2020-11-07 06:36:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:44,361 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 295 transitions. [2020-11-07 06:36:44,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:36:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 295 transitions. [2020-11-07 06:36:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-07 06:36:44,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:44,363 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:44,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:36:44,364 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1587544774, now seen corresponding path program 1 times [2020-11-07 06:36:44,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:44,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1882711392] [2020-11-07 06:36:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:36:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:36:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-11-07 06:36:44,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1882711392] [2020-11-07 06:36:44,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:44,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:36:44,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891040280] [2020-11-07 06:36:44,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:36:44,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:44,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:36:44,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:44,538 INFO L87 Difference]: Start difference. First operand 223 states and 295 transitions. Second operand 10 states. [2020-11-07 06:36:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:45,572 INFO L93 Difference]: Finished difference Result 249 states and 324 transitions. [2020-11-07 06:36:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:36:45,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2020-11-07 06:36:45,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:45,577 INFO L225 Difference]: With dead ends: 249 [2020-11-07 06:36:45,577 INFO L226 Difference]: Without dead ends: 245 [2020-11-07 06:36:45,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:36:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-11-07 06:36:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 236. [2020-11-07 06:36:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-11-07 06:36:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 310 transitions. [2020-11-07 06:36:45,636 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 310 transitions. Word has length 83 [2020-11-07 06:36:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:45,636 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 310 transitions. [2020-11-07 06:36:45,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:36:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 310 transitions. [2020-11-07 06:36:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-07 06:36:45,639 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:45,639 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:45,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:36:45,639 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:45,640 INFO L82 PathProgramCache]: Analyzing trace with hash -76376755, now seen corresponding path program 1 times [2020-11-07 06:36:45,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:45,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [810101471] [2020-11-07 06:36:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:36:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:36:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:36:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-11-07 06:36:45,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [810101471] [2020-11-07 06:36:45,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:45,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:36:45,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889240313] [2020-11-07 06:36:45,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:36:45,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:36:45,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:36:45,791 INFO L87 Difference]: Start difference. First operand 236 states and 310 transitions. Second operand 8 states. [2020-11-07 06:36:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:46,615 INFO L93 Difference]: Finished difference Result 253 states and 327 transitions. [2020-11-07 06:36:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:36:46,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2020-11-07 06:36:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:46,619 INFO L225 Difference]: With dead ends: 253 [2020-11-07 06:36:46,619 INFO L226 Difference]: Without dead ends: 249 [2020-11-07 06:36:46,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:36:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-11-07 06:36:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 241. [2020-11-07 06:36:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-11-07 06:36:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 315 transitions. [2020-11-07 06:36:46,660 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 315 transitions. Word has length 88 [2020-11-07 06:36:46,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:46,661 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 315 transitions. [2020-11-07 06:36:46,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:36:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 315 transitions. [2020-11-07 06:36:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-07 06:36:46,663 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:46,663 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:46,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:36:46,663 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:46,664 INFO L82 PathProgramCache]: Analyzing trace with hash 117247865, now seen corresponding path program 2 times [2020-11-07 06:36:46,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:46,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [824772430] [2020-11-07 06:36:46,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:36:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-07 06:36:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:36:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-11-07 06:36:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 06:36:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 06:36:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-11-07 06:36:46,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [824772430] [2020-11-07 06:36:46,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:46,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:36:46,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55979731] [2020-11-07 06:36:46,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:36:46,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:36:46,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:36:46,805 INFO L87 Difference]: Start difference. First operand 241 states and 315 transitions. Second operand 7 states. [2020-11-07 06:36:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:47,542 INFO L93 Difference]: Finished difference Result 419 states and 558 transitions. [2020-11-07 06:36:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:36:47,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2020-11-07 06:36:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:47,545 INFO L225 Difference]: With dead ends: 419 [2020-11-07 06:36:47,545 INFO L226 Difference]: Without dead ends: 240 [2020-11-07 06:36:47,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:36:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-11-07 06:36:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2020-11-07 06:36:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-11-07 06:36:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 312 transitions. [2020-11-07 06:36:47,589 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 312 transitions. Word has length 95 [2020-11-07 06:36:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:47,589 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 312 transitions. [2020-11-07 06:36:47,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:36:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 312 transitions. [2020-11-07 06:36:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 06:36:47,591 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:47,591 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:47,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:36:47,591 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1057017687, now seen corresponding path program 1 times [2020-11-07 06:36:47,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:47,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1856763057] [2020-11-07 06:36:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:36:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:36:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:36:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:36:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-11-07 06:36:47,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1856763057] [2020-11-07 06:36:47,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:47,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 06:36:47,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985654194] [2020-11-07 06:36:47,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:36:47,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:47,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:36:47,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:36:47,775 INFO L87 Difference]: Start difference. First operand 240 states and 312 transitions. Second operand 12 states. [2020-11-07 06:36:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:48,981 INFO L93 Difference]: Finished difference Result 264 states and 337 transitions. [2020-11-07 06:36:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:36:48,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-11-07 06:36:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:48,984 INFO L225 Difference]: With dead ends: 264 [2020-11-07 06:36:48,984 INFO L226 Difference]: Without dead ends: 260 [2020-11-07 06:36:48,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2020-11-07 06:36:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-11-07 06:36:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2020-11-07 06:36:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-11-07 06:36:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 323 transitions. [2020-11-07 06:36:49,024 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 323 transitions. Word has length 99 [2020-11-07 06:36:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:49,024 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 323 transitions. [2020-11-07 06:36:49,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:36:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 323 transitions. [2020-11-07 06:36:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-07 06:36:49,026 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:49,026 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:49,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 06:36:49,027 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:49,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:49,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1682959562, now seen corresponding path program 1 times [2020-11-07 06:36:49,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:49,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370229330] [2020-11-07 06:36:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:36:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:36:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:36:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:36:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:36:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-11-07 06:36:49,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370229330] [2020-11-07 06:36:49,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:49,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:36:49,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837246576] [2020-11-07 06:36:49,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:36:49,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:36:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:49,190 INFO L87 Difference]: Start difference. First operand 251 states and 323 transitions. Second operand 10 states. [2020-11-07 06:36:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:50,254 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2020-11-07 06:36:50,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:36:50,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2020-11-07 06:36:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:50,257 INFO L225 Difference]: With dead ends: 268 [2020-11-07 06:36:50,258 INFO L226 Difference]: Without dead ends: 264 [2020-11-07 06:36:50,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:36:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-11-07 06:36:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2020-11-07 06:36:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-11-07 06:36:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 328 transitions. [2020-11-07 06:36:50,308 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 328 transitions. Word has length 104 [2020-11-07 06:36:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:50,309 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 328 transitions. [2020-11-07 06:36:50,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:36:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 328 transitions. [2020-11-07 06:36:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 06:36:50,311 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:50,311 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:50,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 06:36:50,311 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash -304830453, now seen corresponding path program 1 times [2020-11-07 06:36:50,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:50,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224794635] [2020-11-07 06:36:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:36:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:36:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:36:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 06:36:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:36:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-11-07 06:36:50,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [224794635] [2020-11-07 06:36:50,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:50,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:36:50,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458365900] [2020-11-07 06:36:50,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:36:50,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:36:50,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:50,465 INFO L87 Difference]: Start difference. First operand 256 states and 328 transitions. Second operand 10 states. [2020-11-07 06:36:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:51,589 INFO L93 Difference]: Finished difference Result 368 states and 490 transitions. [2020-11-07 06:36:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:36:51,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2020-11-07 06:36:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:51,593 INFO L225 Difference]: With dead ends: 368 [2020-11-07 06:36:51,593 INFO L226 Difference]: Without dead ends: 364 [2020-11-07 06:36:51,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:36:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-11-07 06:36:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 326. [2020-11-07 06:36:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-11-07 06:36:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 430 transitions. [2020-11-07 06:36:51,647 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 430 transitions. Word has length 108 [2020-11-07 06:36:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:51,648 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 430 transitions. [2020-11-07 06:36:51,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:36:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 430 transitions. [2020-11-07 06:36:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 06:36:51,650 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:51,650 INFO L422 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:51,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 06:36:51,651 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:51,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:51,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1611775781, now seen corresponding path program 1 times [2020-11-07 06:36:51,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:51,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [32672708] [2020-11-07 06:36:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:36:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:36:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:36:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:36:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:36:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:36:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2020-11-07 06:36:51,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [32672708] [2020-11-07 06:36:51,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:51,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:36:51,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317728938] [2020-11-07 06:36:51,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:36:51,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:36:51,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:36:51,787 INFO L87 Difference]: Start difference. First operand 326 states and 430 transitions. Second operand 8 states. [2020-11-07 06:36:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:52,465 INFO L93 Difference]: Finished difference Result 357 states and 469 transitions. [2020-11-07 06:36:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:36:52,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2020-11-07 06:36:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:52,468 INFO L225 Difference]: With dead ends: 357 [2020-11-07 06:36:52,468 INFO L226 Difference]: Without dead ends: 353 [2020-11-07 06:36:52,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:36:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-11-07 06:36:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 330. [2020-11-07 06:36:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-11-07 06:36:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 433 transitions. [2020-11-07 06:36:52,523 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 433 transitions. Word has length 114 [2020-11-07 06:36:52,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:52,524 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 433 transitions. [2020-11-07 06:36:52,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:36:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 433 transitions. [2020-11-07 06:36:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-07 06:36:52,526 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:52,527 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:52,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 06:36:52,527 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:52,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1161890814, now seen corresponding path program 2 times [2020-11-07 06:36:52,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:52,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1471906767] [2020-11-07 06:36:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:36:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:36:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:36:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 06:36:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:36:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-07 06:36:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-07 06:36:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-11-07 06:36:52,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1471906767] [2020-11-07 06:36:52,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:52,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:36:52,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785125393] [2020-11-07 06:36:52,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:36:52,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:52,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:36:52,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:36:52,654 INFO L87 Difference]: Start difference. First operand 330 states and 433 transitions. Second operand 6 states. [2020-11-07 06:36:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:53,110 INFO L93 Difference]: Finished difference Result 514 states and 669 transitions. [2020-11-07 06:36:53,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:36:53,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2020-11-07 06:36:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:53,114 INFO L225 Difference]: With dead ends: 514 [2020-11-07 06:36:53,114 INFO L226 Difference]: Without dead ends: 267 [2020-11-07 06:36:53,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-11-07 06:36:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2020-11-07 06:36:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2020-11-07 06:36:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2020-11-07 06:36:53,159 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 118 [2020-11-07 06:36:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:53,159 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2020-11-07 06:36:53,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:36:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2020-11-07 06:36:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-07 06:36:53,161 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:53,161 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:53,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 06:36:53,161 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1028663308, now seen corresponding path program 1 times [2020-11-07 06:36:53,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:53,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1825722802] [2020-11-07 06:36:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:36:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:36:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:36:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:36:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:36:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:36:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:36:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-11-07 06:36:53,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1825722802] [2020-11-07 06:36:53,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:53,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:36:53,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689093852] [2020-11-07 06:36:53,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:36:53,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:53,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:36:53,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:53,362 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 10 states. [2020-11-07 06:36:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:54,551 INFO L93 Difference]: Finished difference Result 350 states and 443 transitions. [2020-11-07 06:36:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:36:54,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 119 [2020-11-07 06:36:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:54,554 INFO L225 Difference]: With dead ends: 350 [2020-11-07 06:36:54,555 INFO L226 Difference]: Without dead ends: 346 [2020-11-07 06:36:54,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:36:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-11-07 06:36:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 310. [2020-11-07 06:36:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-11-07 06:36:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 393 transitions. [2020-11-07 06:36:54,608 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 393 transitions. Word has length 119 [2020-11-07 06:36:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:54,608 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 393 transitions. [2020-11-07 06:36:54,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:36:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 393 transitions. [2020-11-07 06:36:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-07 06:36:54,610 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:54,610 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:54,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 06:36:54,610 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:54,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:54,611 INFO L82 PathProgramCache]: Analyzing trace with hash -815371058, now seen corresponding path program 1 times [2020-11-07 06:36:54,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:54,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1003497149] [2020-11-07 06:36:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:36:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:36:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:36:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:36:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:36:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:36:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:36:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-11-07 06:36:54,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1003497149] [2020-11-07 06:36:54,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:54,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:36:54,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391906822] [2020-11-07 06:36:54,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:36:54,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:54,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:36:54,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:54,763 INFO L87 Difference]: Start difference. First operand 310 states and 393 transitions. Second operand 10 states. [2020-11-07 06:36:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:55,928 INFO L93 Difference]: Finished difference Result 366 states and 464 transitions. [2020-11-07 06:36:55,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:36:55,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 119 [2020-11-07 06:36:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:55,931 INFO L225 Difference]: With dead ends: 366 [2020-11-07 06:36:55,931 INFO L226 Difference]: Without dead ends: 362 [2020-11-07 06:36:55,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:36:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-11-07 06:36:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 334. [2020-11-07 06:36:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-11-07 06:36:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 424 transitions. [2020-11-07 06:36:55,986 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 424 transitions. Word has length 119 [2020-11-07 06:36:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:55,986 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 424 transitions. [2020-11-07 06:36:55,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:36:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 424 transitions. [2020-11-07 06:36:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-07 06:36:55,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:55,988 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:55,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 06:36:55,988 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:55,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1631717761, now seen corresponding path program 1 times [2020-11-07 06:36:55,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:55,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904738465] [2020-11-07 06:36:55,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:36:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:36:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:36:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:36:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:36:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:36:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-07 06:36:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 31 proven. 20 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-11-07 06:36:56,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904738465] [2020-11-07 06:36:56,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:56,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:36:56,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394946341] [2020-11-07 06:36:56,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:36:56,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:36:56,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:56,136 INFO L87 Difference]: Start difference. First operand 334 states and 424 transitions. Second operand 10 states. [2020-11-07 06:36:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:57,531 INFO L93 Difference]: Finished difference Result 436 states and 568 transitions. [2020-11-07 06:36:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:36:57,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 121 [2020-11-07 06:36:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:57,535 INFO L225 Difference]: With dead ends: 436 [2020-11-07 06:36:57,535 INFO L226 Difference]: Without dead ends: 432 [2020-11-07 06:36:57,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:36:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-07 06:36:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 394. [2020-11-07 06:36:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-11-07 06:36:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 514 transitions. [2020-11-07 06:36:57,600 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 514 transitions. Word has length 121 [2020-11-07 06:36:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:57,601 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 514 transitions. [2020-11-07 06:36:57,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:36:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 514 transitions. [2020-11-07 06:36:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-11-07 06:36:57,602 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:57,603 INFO L422 BasicCegarLoop]: trace histogram [15, 14, 14, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:57,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 06:36:57,603 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1735456635, now seen corresponding path program 1 times [2020-11-07 06:36:57,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:57,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1972749574] [2020-11-07 06:36:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:36:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:36:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:36:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:36:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:36:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:36:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:36:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:36:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2020-11-07 06:36:57,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1972749574] [2020-11-07 06:36:57,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:57,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:36:57,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416169463] [2020-11-07 06:36:57,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:36:57,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:57,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:36:57,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:36:57,737 INFO L87 Difference]: Start difference. First operand 394 states and 514 transitions. Second operand 9 states. [2020-11-07 06:36:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:58,445 INFO L93 Difference]: Finished difference Result 402 states and 521 transitions. [2020-11-07 06:36:58,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:36:58,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2020-11-07 06:36:58,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:58,449 INFO L225 Difference]: With dead ends: 402 [2020-11-07 06:36:58,449 INFO L226 Difference]: Without dead ends: 398 [2020-11-07 06:36:58,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:36:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2020-11-07 06:36:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2020-11-07 06:36:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-11-07 06:36:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 517 transitions. [2020-11-07 06:36:58,514 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 517 transitions. Word has length 124 [2020-11-07 06:36:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:58,515 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 517 transitions. [2020-11-07 06:36:58,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:36:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 517 transitions. [2020-11-07 06:36:58,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 06:36:58,517 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:58,517 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:58,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 06:36:58,517 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:58,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:58,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2058081113, now seen corresponding path program 1 times [2020-11-07 06:36:58,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:58,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1615930881] [2020-11-07 06:36:58,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:36:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:36:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:36:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:36:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:36:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:36:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:36:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:36:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:36:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:36:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:36:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:36:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:36:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:36:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-11-07 06:36:58,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1615930881] [2020-11-07 06:36:58,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:58,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:36:58,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012707159] [2020-11-07 06:36:58,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:36:58,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:36:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:36:58,682 INFO L87 Difference]: Start difference. First operand 398 states and 517 transitions. Second operand 12 states. [2020-11-07 06:37:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:00,131 INFO L93 Difference]: Finished difference Result 445 states and 579 transitions. [2020-11-07 06:37:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:37:00,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 129 [2020-11-07 06:37:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:00,135 INFO L225 Difference]: With dead ends: 445 [2020-11-07 06:37:00,135 INFO L226 Difference]: Without dead ends: 437 [2020-11-07 06:37:00,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:37:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-11-07 06:37:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 421. [2020-11-07 06:37:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-07 06:37:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 550 transitions. [2020-11-07 06:37:00,205 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 550 transitions. Word has length 129 [2020-11-07 06:37:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:00,206 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 550 transitions. [2020-11-07 06:37:00,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:37:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 550 transitions. [2020-11-07 06:37:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 06:37:00,207 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:00,208 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:00,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 06:37:00,208 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:00,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:00,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1829523182, now seen corresponding path program 1 times [2020-11-07 06:37:00,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:00,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1494693747] [2020-11-07 06:37:00,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:37:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-11-07 06:37:00,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1494693747] [2020-11-07 06:37:00,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:00,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:37:00,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093361925] [2020-11-07 06:37:00,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:37:00,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:00,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:37:00,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:37:00,362 INFO L87 Difference]: Start difference. First operand 421 states and 550 transitions. Second operand 10 states. [2020-11-07 06:37:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:01,575 INFO L93 Difference]: Finished difference Result 459 states and 591 transitions. [2020-11-07 06:37:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:37:01,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2020-11-07 06:37:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:01,579 INFO L225 Difference]: With dead ends: 459 [2020-11-07 06:37:01,579 INFO L226 Difference]: Without dead ends: 455 [2020-11-07 06:37:01,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:37:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-11-07 06:37:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 435. [2020-11-07 06:37:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-11-07 06:37:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 567 transitions. [2020-11-07 06:37:01,644 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 567 transitions. Word has length 129 [2020-11-07 06:37:01,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:01,644 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 567 transitions. [2020-11-07 06:37:01,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:37:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 567 transitions. [2020-11-07 06:37:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-07 06:37:01,646 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:01,646 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:01,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 06:37:01,646 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash -855516814, now seen corresponding path program 3 times [2020-11-07 06:37:01,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:01,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [550348894] [2020-11-07 06:37:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-07 06:37:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:37:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2020-11-07 06:37:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 40 proven. 19 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-11-07 06:37:01,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [550348894] [2020-11-07 06:37:01,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:01,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:37:01,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384038298] [2020-11-07 06:37:01,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:37:01,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:37:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:37:01,799 INFO L87 Difference]: Start difference. First operand 435 states and 567 transitions. Second operand 10 states. [2020-11-07 06:37:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:03,116 INFO L93 Difference]: Finished difference Result 491 states and 638 transitions. [2020-11-07 06:37:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:37:03,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2020-11-07 06:37:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:03,122 INFO L225 Difference]: With dead ends: 491 [2020-11-07 06:37:03,122 INFO L226 Difference]: Without dead ends: 483 [2020-11-07 06:37:03,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:37:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2020-11-07 06:37:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 461. [2020-11-07 06:37:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-11-07 06:37:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 603 transitions. [2020-11-07 06:37:03,202 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 603 transitions. Word has length 131 [2020-11-07 06:37:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:03,202 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 603 transitions. [2020-11-07 06:37:03,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:37:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 603 transitions. [2020-11-07 06:37:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-07 06:37:03,205 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:03,205 INFO L422 BasicCegarLoop]: trace histogram [17, 16, 16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:03,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 06:37:03,205 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1124018072, now seen corresponding path program 1 times [2020-11-07 06:37:03,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:03,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1427252512] [2020-11-07 06:37:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:37:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2020-11-07 06:37:03,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1427252512] [2020-11-07 06:37:03,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:03,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:37:03,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394858894] [2020-11-07 06:37:03,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:37:03,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:03,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:37:03,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:37:03,385 INFO L87 Difference]: Start difference. First operand 461 states and 603 transitions. Second operand 11 states. [2020-11-07 06:37:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:04,261 INFO L93 Difference]: Finished difference Result 469 states and 610 transitions. [2020-11-07 06:37:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 06:37:04,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2020-11-07 06:37:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:04,265 INFO L225 Difference]: With dead ends: 469 [2020-11-07 06:37:04,265 INFO L226 Difference]: Without dead ends: 465 [2020-11-07 06:37:04,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:37:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-11-07 06:37:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2020-11-07 06:37:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2020-11-07 06:37:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 606 transitions. [2020-11-07 06:37:04,336 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 606 transitions. Word has length 140 [2020-11-07 06:37:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:04,337 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 606 transitions. [2020-11-07 06:37:04,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:37:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 606 transitions. [2020-11-07 06:37:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-07 06:37:04,339 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:04,339 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:04,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 06:37:04,339 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:04,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:04,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2901099, now seen corresponding path program 1 times [2020-11-07 06:37:04,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:04,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [465029364] [2020-11-07 06:37:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:37:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 06:37:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2020-11-07 06:37:04,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [465029364] [2020-11-07 06:37:04,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:04,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:37:04,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245443893] [2020-11-07 06:37:04,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:37:04,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:37:04,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:37:04,517 INFO L87 Difference]: Start difference. First operand 465 states and 606 transitions. Second operand 12 states. [2020-11-07 06:37:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:05,975 INFO L93 Difference]: Finished difference Result 501 states and 643 transitions. [2020-11-07 06:37:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:37:05,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 145 [2020-11-07 06:37:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:05,979 INFO L225 Difference]: With dead ends: 501 [2020-11-07 06:37:05,979 INFO L226 Difference]: Without dead ends: 497 [2020-11-07 06:37:05,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:37:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-11-07 06:37:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 477. [2020-11-07 06:37:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-11-07 06:37:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 619 transitions. [2020-11-07 06:37:06,053 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 619 transitions. Word has length 145 [2020-11-07 06:37:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:06,054 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 619 transitions. [2020-11-07 06:37:06,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:37:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 619 transitions. [2020-11-07 06:37:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-11-07 06:37:06,056 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:06,056 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:06,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 06:37:06,056 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:06,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:06,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1333777400, now seen corresponding path program 2 times [2020-11-07 06:37:06,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:06,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1422718911] [2020-11-07 06:37:06,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-11-07 06:37:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 41 proven. 16 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-11-07 06:37:06,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1422718911] [2020-11-07 06:37:06,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:06,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:37:06,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558145136] [2020-11-07 06:37:06,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:37:06,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:37:06,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:37:06,232 INFO L87 Difference]: Start difference. First operand 477 states and 619 transitions. Second operand 12 states. [2020-11-07 06:37:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:07,769 INFO L93 Difference]: Finished difference Result 595 states and 787 transitions. [2020-11-07 06:37:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 06:37:07,774 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2020-11-07 06:37:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:07,779 INFO L225 Difference]: With dead ends: 595 [2020-11-07 06:37:07,779 INFO L226 Difference]: Without dead ends: 591 [2020-11-07 06:37:07,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2020-11-07 06:37:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-11-07 06:37:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 567. [2020-11-07 06:37:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2020-11-07 06:37:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 751 transitions. [2020-11-07 06:37:07,876 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 751 transitions. Word has length 158 [2020-11-07 06:37:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:07,877 INFO L481 AbstractCegarLoop]: Abstraction has 567 states and 751 transitions. [2020-11-07 06:37:07,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:37:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 751 transitions. [2020-11-07 06:37:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-11-07 06:37:07,894 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:07,895 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:07,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-07 06:37:07,895 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2115648297, now seen corresponding path program 1 times [2020-11-07 06:37:07,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:07,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1847099275] [2020-11-07 06:37:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 42 proven. 10 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-11-07 06:37:08,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1847099275] [2020-11-07 06:37:08,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:08,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:37:08,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781297959] [2020-11-07 06:37:08,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:37:08,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:08,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:37:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:37:08,085 INFO L87 Difference]: Start difference. First operand 567 states and 751 transitions. Second operand 12 states. [2020-11-07 06:37:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:09,755 INFO L93 Difference]: Finished difference Result 710 states and 952 transitions. [2020-11-07 06:37:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:37:09,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 160 [2020-11-07 06:37:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:09,761 INFO L225 Difference]: With dead ends: 710 [2020-11-07 06:37:09,761 INFO L226 Difference]: Without dead ends: 706 [2020-11-07 06:37:09,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:37:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-11-07 06:37:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 649. [2020-11-07 06:37:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2020-11-07 06:37:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 875 transitions. [2020-11-07 06:37:09,895 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 875 transitions. Word has length 160 [2020-11-07 06:37:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:09,896 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 875 transitions. [2020-11-07 06:37:09,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:37:09,896 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 875 transitions. [2020-11-07 06:37:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-11-07 06:37:09,898 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:09,899 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:09,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-07 06:37:09,899 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:09,899 INFO L82 PathProgramCache]: Analyzing trace with hash -495506893, now seen corresponding path program 2 times [2020-11-07 06:37:09,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:09,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1313814131] [2020-11-07 06:37:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:37:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 06:37:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 06:37:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 42 proven. 10 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-11-07 06:37:10,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1313814131] [2020-11-07 06:37:10,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:10,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:37:10,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809954645] [2020-11-07 06:37:10,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:37:10,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:37:10,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:37:10,080 INFO L87 Difference]: Start difference. First operand 649 states and 875 transitions. Second operand 12 states. [2020-11-07 06:37:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:11,806 INFO L93 Difference]: Finished difference Result 791 states and 1075 transitions. [2020-11-07 06:37:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 06:37:11,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 160 [2020-11-07 06:37:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:11,812 INFO L225 Difference]: With dead ends: 791 [2020-11-07 06:37:11,812 INFO L226 Difference]: Without dead ends: 787 [2020-11-07 06:37:11,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2020-11-07 06:37:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2020-11-07 06:37:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 659. [2020-11-07 06:37:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-11-07 06:37:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 889 transitions. [2020-11-07 06:37:11,930 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 889 transitions. Word has length 160 [2020-11-07 06:37:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:11,931 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 889 transitions. [2020-11-07 06:37:11,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:37:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 889 transitions. [2020-11-07 06:37:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-11-07 06:37:11,933 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:11,934 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:11,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-07 06:37:11,934 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:11,934 INFO L82 PathProgramCache]: Analyzing trace with hash -282214643, now seen corresponding path program 2 times [2020-11-07 06:37:11,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:11,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1912528055] [2020-11-07 06:37:11,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-07 06:37:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:37:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-11-07 06:37:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:37:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-11-07 06:37:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 45 proven. 22 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2020-11-07 06:37:12,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1912528055] [2020-11-07 06:37:12,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:12,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:37:12,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398660893] [2020-11-07 06:37:12,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:37:12,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:12,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:37:12,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:37:12,113 INFO L87 Difference]: Start difference. First operand 659 states and 889 transitions. Second operand 12 states. [2020-11-07 06:37:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:13,766 INFO L93 Difference]: Finished difference Result 732 states and 983 transitions. [2020-11-07 06:37:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:37:13,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 160 [2020-11-07 06:37:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:13,771 INFO L225 Difference]: With dead ends: 732 [2020-11-07 06:37:13,771 INFO L226 Difference]: Without dead ends: 728 [2020-11-07 06:37:13,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:37:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-11-07 06:37:13,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 693. [2020-11-07 06:37:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-11-07 06:37:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 934 transitions. [2020-11-07 06:37:13,887 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 934 transitions. Word has length 160 [2020-11-07 06:37:13,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:13,888 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 934 transitions. [2020-11-07 06:37:13,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:37:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 934 transitions. [2020-11-07 06:37:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-11-07 06:37:13,891 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:13,891 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:13,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-07 06:37:13,891 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash -749319784, now seen corresponding path program 3 times [2020-11-07 06:37:13,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:13,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1790604566] [2020-11-07 06:37:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-11-07 06:37:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-07 06:37:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-11-07 06:37:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 50 proven. 13 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2020-11-07 06:37:14,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1790604566] [2020-11-07 06:37:14,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:14,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:37:14,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746120487] [2020-11-07 06:37:14,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:37:14,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:37:14,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:37:14,109 INFO L87 Difference]: Start difference. First operand 693 states and 934 transitions. Second operand 14 states. [2020-11-07 06:37:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:15,905 INFO L93 Difference]: Finished difference Result 799 states and 1078 transitions. [2020-11-07 06:37:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 06:37:15,906 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2020-11-07 06:37:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:15,911 INFO L225 Difference]: With dead ends: 799 [2020-11-07 06:37:15,911 INFO L226 Difference]: Without dead ends: 791 [2020-11-07 06:37:15,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2020-11-07 06:37:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2020-11-07 06:37:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 769. [2020-11-07 06:37:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-11-07 06:37:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1043 transitions. [2020-11-07 06:37:16,058 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1043 transitions. Word has length 168 [2020-11-07 06:37:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:16,058 INFO L481 AbstractCegarLoop]: Abstraction has 769 states and 1043 transitions. [2020-11-07 06:37:16,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:37:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1043 transitions. [2020-11-07 06:37:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-11-07 06:37:16,061 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:16,061 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:16,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-07 06:37:16,062 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash -927477348, now seen corresponding path program 1 times [2020-11-07 06:37:16,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:16,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173970584] [2020-11-07 06:37:16,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:37:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2020-11-07 06:37:16,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [173970584] [2020-11-07 06:37:16,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:16,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:37:16,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515636393] [2020-11-07 06:37:16,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:37:16,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:16,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:37:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:37:16,278 INFO L87 Difference]: Start difference. First operand 769 states and 1043 transitions. Second operand 14 states. [2020-11-07 06:37:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:18,181 INFO L93 Difference]: Finished difference Result 835 states and 1124 transitions. [2020-11-07 06:37:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:37:18,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 170 [2020-11-07 06:37:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:18,188 INFO L225 Difference]: With dead ends: 835 [2020-11-07 06:37:18,188 INFO L226 Difference]: Without dead ends: 827 [2020-11-07 06:37:18,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:37:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2020-11-07 06:37:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 795. [2020-11-07 06:37:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-11-07 06:37:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1079 transitions. [2020-11-07 06:37:18,372 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1079 transitions. Word has length 170 [2020-11-07 06:37:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:18,372 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 1079 transitions. [2020-11-07 06:37:18,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:37:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1079 transitions. [2020-11-07 06:37:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-11-07 06:37:18,376 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:18,376 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:18,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-07 06:37:18,377 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1109066714, now seen corresponding path program 2 times [2020-11-07 06:37:18,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:18,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246118625] [2020-11-07 06:37:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:37:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 06:37:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 06:37:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:37:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2020-11-07 06:37:18,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246118625] [2020-11-07 06:37:18,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:18,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:37:18,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564567729] [2020-11-07 06:37:18,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:37:18,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:18,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:37:18,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:37:18,605 INFO L87 Difference]: Start difference. First operand 795 states and 1079 transitions. Second operand 14 states. [2020-11-07 06:37:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:20,637 INFO L93 Difference]: Finished difference Result 876 states and 1181 transitions. [2020-11-07 06:37:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 06:37:20,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 170 [2020-11-07 06:37:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:20,643 INFO L225 Difference]: With dead ends: 876 [2020-11-07 06:37:20,643 INFO L226 Difference]: Without dead ends: 868 [2020-11-07 06:37:20,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2020-11-07 06:37:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2020-11-07 06:37:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 760. [2020-11-07 06:37:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2020-11-07 06:37:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1027 transitions. [2020-11-07 06:37:20,762 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1027 transitions. Word has length 170 [2020-11-07 06:37:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:20,762 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 1027 transitions. [2020-11-07 06:37:20,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:37:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1027 transitions. [2020-11-07 06:37:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-11-07 06:37:20,765 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:20,765 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:20,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-07 06:37:20,766 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:20,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:20,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1516429715, now seen corresponding path program 2 times [2020-11-07 06:37:20,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:20,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1380355915] [2020-11-07 06:37:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-07 06:37:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:37:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-11-07 06:37:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:37:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-11-07 06:37:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:37:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 52 proven. 19 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2020-11-07 06:37:20,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1380355915] [2020-11-07 06:37:20,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:20,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:37:20,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646455544] [2020-11-07 06:37:20,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:37:20,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:20,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:37:20,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:37:20,948 INFO L87 Difference]: Start difference. First operand 760 states and 1027 transitions. Second operand 12 states. [2020-11-07 06:37:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:22,614 INFO L93 Difference]: Finished difference Result 810 states and 1080 transitions. [2020-11-07 06:37:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:37:22,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2020-11-07 06:37:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:22,619 INFO L225 Difference]: With dead ends: 810 [2020-11-07 06:37:22,619 INFO L226 Difference]: Without dead ends: 806 [2020-11-07 06:37:22,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:37:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-11-07 06:37:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 774. [2020-11-07 06:37:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-11-07 06:37:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1044 transitions. [2020-11-07 06:37:22,765 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1044 transitions. Word has length 170 [2020-11-07 06:37:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:22,766 INFO L481 AbstractCegarLoop]: Abstraction has 774 states and 1044 transitions. [2020-11-07 06:37:22,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:37:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1044 transitions. [2020-11-07 06:37:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-11-07 06:37:22,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:22,769 INFO L422 BasicCegarLoop]: trace histogram [24, 23, 23, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:22,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-07 06:37:22,769 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2005153258, now seen corresponding path program 2 times [2020-11-07 06:37:22,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:22,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584726774] [2020-11-07 06:37:22,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-07 06:37:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:37:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-11-07 06:37:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:37:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-11-07 06:37:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:37:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-11-07 06:37:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2020-11-07 06:37:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 56 proven. 19 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2020-11-07 06:37:22,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584726774] [2020-11-07 06:37:22,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:22,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:37:22,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452321146] [2020-11-07 06:37:22,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:37:22,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:22,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:37:22,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:37:22,991 INFO L87 Difference]: Start difference. First operand 774 states and 1044 transitions. Second operand 14 states. [2020-11-07 06:37:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:25,003 INFO L93 Difference]: Finished difference Result 822 states and 1093 transitions. [2020-11-07 06:37:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:37:25,003 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 186 [2020-11-07 06:37:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:25,008 INFO L225 Difference]: With dead ends: 822 [2020-11-07 06:37:25,008 INFO L226 Difference]: Without dead ends: 818 [2020-11-07 06:37:25,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:37:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2020-11-07 06:37:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 786. [2020-11-07 06:37:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-11-07 06:37:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1057 transitions. [2020-11-07 06:37:25,138 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1057 transitions. Word has length 186 [2020-11-07 06:37:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:25,138 INFO L481 AbstractCegarLoop]: Abstraction has 786 states and 1057 transitions. [2020-11-07 06:37:25,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:37:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1057 transitions. [2020-11-07 06:37:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-07 06:37:25,141 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:25,142 INFO L422 BasicCegarLoop]: trace histogram [26, 25, 25, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:25,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-07 06:37:25,142 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:25,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1909526749, now seen corresponding path program 3 times [2020-11-07 06:37:25,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:25,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [276941603] [2020-11-07 06:37:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:37:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 06:37:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 06:37:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 06:37:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-11-07 06:37:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2020-11-07 06:37:25,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [276941603] [2020-11-07 06:37:25,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:25,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:37:25,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282225374] [2020-11-07 06:37:25,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:37:25,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:37:25,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:37:25,412 INFO L87 Difference]: Start difference. First operand 786 states and 1057 transitions. Second operand 14 states. [2020-11-07 06:37:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:27,602 INFO L93 Difference]: Finished difference Result 1115 states and 1530 transitions. [2020-11-07 06:37:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 06:37:27,602 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 199 [2020-11-07 06:37:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:27,611 INFO L225 Difference]: With dead ends: 1115 [2020-11-07 06:37:27,611 INFO L226 Difference]: Without dead ends: 1111 [2020-11-07 06:37:27,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2020-11-07 06:37:27,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2020-11-07 06:37:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1025. [2020-11-07 06:37:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2020-11-07 06:37:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1413 transitions. [2020-11-07 06:37:27,843 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1413 transitions. Word has length 199 [2020-11-07 06:37:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:27,843 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1413 transitions. [2020-11-07 06:37:27,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:37:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1413 transitions. [2020-11-07 06:37:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-07 06:37:27,846 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:27,847 INFO L422 BasicCegarLoop]: trace histogram [26, 25, 25, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:27,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-07 06:37:27,847 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:27,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash -954254390, now seen corresponding path program 4 times [2020-11-07 06:37:27,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:27,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [503731590] [2020-11-07 06:37:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:37:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 06:37:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 06:37:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:37:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 06:37:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 06:37:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 06:37:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2020-11-07 06:37:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 65 proven. 26 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2020-11-07 06:37:28,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [503731590] [2020-11-07 06:37:28,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:28,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:37:28,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589544048] [2020-11-07 06:37:28,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:37:28,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:28,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:37:28,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:37:28,101 INFO L87 Difference]: Start difference. First operand 1025 states and 1413 transitions. Second operand 14 states. [2020-11-07 06:37:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:30,561 INFO L93 Difference]: Finished difference Result 1445 states and 2022 transitions. [2020-11-07 06:37:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 06:37:30,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 201 [2020-11-07 06:37:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:30,572 INFO L225 Difference]: With dead ends: 1445 [2020-11-07 06:37:30,572 INFO L226 Difference]: Without dead ends: 1441 [2020-11-07 06:37:30,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2020-11-07 06:37:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-11-07 06:37:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1356. [2020-11-07 06:37:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2020-11-07 06:37:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1899 transitions. [2020-11-07 06:37:30,799 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1899 transitions. Word has length 201 [2020-11-07 06:37:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:30,799 INFO L481 AbstractCegarLoop]: Abstraction has 1356 states and 1899 transitions. [2020-11-07 06:37:30,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:37:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1899 transitions. [2020-11-07 06:37:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-07 06:37:30,803 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:30,803 INFO L422 BasicCegarLoop]: trace histogram [26, 25, 25, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:30,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-07 06:37:30,803 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:30,804 INFO L82 PathProgramCache]: Analyzing trace with hash 729557716, now seen corresponding path program 5 times [2020-11-07 06:37:30,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:30,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284757999] [2020-11-07 06:37:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-07 06:37:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:37:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-11-07 06:37:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:37:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-11-07 06:37:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:37:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-11-07 06:37:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2020-11-07 06:37:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2020-11-07 06:37:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:30,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2020-11-07 06:37:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 65 proven. 26 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2020-11-07 06:37:31,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284757999] [2020-11-07 06:37:31,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:31,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:37:31,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90694503] [2020-11-07 06:37:31,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:37:31,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:31,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:37:31,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:37:31,027 INFO L87 Difference]: Start difference. First operand 1356 states and 1899 transitions. Second operand 14 states. [2020-11-07 06:37:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:33,519 INFO L93 Difference]: Finished difference Result 1686 states and 2377 transitions. [2020-11-07 06:37:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 06:37:33,520 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 201 [2020-11-07 06:37:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:33,539 INFO L225 Difference]: With dead ends: 1686 [2020-11-07 06:37:33,539 INFO L226 Difference]: Without dead ends: 1682 [2020-11-07 06:37:33,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2020-11-07 06:37:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2020-11-07 06:37:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1356. [2020-11-07 06:37:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2020-11-07 06:37:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1899 transitions. [2020-11-07 06:37:33,769 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1899 transitions. Word has length 201 [2020-11-07 06:37:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:33,769 INFO L481 AbstractCegarLoop]: Abstraction has 1356 states and 1899 transitions. [2020-11-07 06:37:33,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:37:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1899 transitions. [2020-11-07 06:37:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-07 06:37:33,773 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:33,773 INFO L422 BasicCegarLoop]: trace histogram [28, 27, 27, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:33,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-07 06:37:33,773 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:33,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:33,774 INFO L82 PathProgramCache]: Analyzing trace with hash -460739837, now seen corresponding path program 6 times [2020-11-07 06:37:33,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:33,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1143382367] [2020-11-07 06:37:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:33,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:37:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 06:37:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 06:37:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 06:37:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-11-07 06:37:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:37:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-11-07 06:37:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 68 proven. 19 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2020-11-07 06:37:34,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1143382367] [2020-11-07 06:37:34,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:34,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:37:34,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537068163] [2020-11-07 06:37:34,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:37:34,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:34,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:37:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:37:34,074 INFO L87 Difference]: Start difference. First operand 1356 states and 1899 transitions. Second operand 16 states. [2020-11-07 06:37:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:36,636 INFO L93 Difference]: Finished difference Result 1613 states and 2255 transitions. [2020-11-07 06:37:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 06:37:36,636 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 209 [2020-11-07 06:37:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:36,647 INFO L225 Difference]: With dead ends: 1613 [2020-11-07 06:37:36,647 INFO L226 Difference]: Without dead ends: 1601 [2020-11-07 06:37:36,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 06:37:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2020-11-07 06:37:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1520. [2020-11-07 06:37:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2020-11-07 06:37:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2138 transitions. [2020-11-07 06:37:36,898 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2138 transitions. Word has length 209 [2020-11-07 06:37:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:36,899 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 2138 transitions. [2020-11-07 06:37:36,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:37:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2138 transitions. [2020-11-07 06:37:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-11-07 06:37:36,902 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:36,903 INFO L422 BasicCegarLoop]: trace histogram [28, 27, 27, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:36,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-07 06:37:36,903 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:36,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:36,903 INFO L82 PathProgramCache]: Analyzing trace with hash -212779779, now seen corresponding path program 3 times [2020-11-07 06:37:36,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:36,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [659207556] [2020-11-07 06:37:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:37:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 06:37:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 06:37:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:37:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 06:37:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 06:37:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 06:37:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2020-11-07 06:37:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-11-07 06:37:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2020-11-07 06:37:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 72 proven. 25 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2020-11-07 06:37:37,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [659207556] [2020-11-07 06:37:37,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:37,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:37:37,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082949674] [2020-11-07 06:37:37,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:37:37,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:37:37,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:37:37,192 INFO L87 Difference]: Start difference. First operand 1520 states and 2138 transitions. Second operand 16 states. [2020-11-07 06:37:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:39,973 INFO L93 Difference]: Finished difference Result 1890 states and 2658 transitions. [2020-11-07 06:37:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 06:37:39,975 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 211 [2020-11-07 06:37:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:39,987 INFO L225 Difference]: With dead ends: 1890 [2020-11-07 06:37:39,988 INFO L226 Difference]: Without dead ends: 1878 [2020-11-07 06:37:39,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 06:37:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2020-11-07 06:37:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1775. [2020-11-07 06:37:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2020-11-07 06:37:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2503 transitions. [2020-11-07 06:37:40,285 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2503 transitions. Word has length 211 [2020-11-07 06:37:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:40,285 INFO L481 AbstractCegarLoop]: Abstraction has 1775 states and 2503 transitions. [2020-11-07 06:37:40,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:37:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2503 transitions. [2020-11-07 06:37:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-11-07 06:37:40,289 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:40,290 INFO L422 BasicCegarLoop]: trace histogram [28, 27, 27, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:40,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-07 06:37:40,290 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:40,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:40,290 INFO L82 PathProgramCache]: Analyzing trace with hash -394369145, now seen corresponding path program 4 times [2020-11-07 06:37:40,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:40,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [608629463] [2020-11-07 06:37:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:37:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-11-07 06:37:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 06:37:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:37:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:37:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-07 06:37:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:37:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:37:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-11-07 06:37:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:37:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-11-07 06:37:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:37:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-11-07 06:37:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2020-11-07 06:37:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2020-11-07 06:37:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2020-11-07 06:37:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-11-07 06:37:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2020-11-07 06:37:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 72 proven. 25 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2020-11-07 06:37:40,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [608629463] [2020-11-07 06:37:40,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:40,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:37:40,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439743300] [2020-11-07 06:37:40,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:37:40,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:37:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:37:40,659 INFO L87 Difference]: Start difference. First operand 1775 states and 2503 transitions. Second operand 16 states. [2020-11-07 06:37:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:43,728 INFO L93 Difference]: Finished difference Result 1980 states and 2781 transitions. [2020-11-07 06:37:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 06:37:43,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 211 [2020-11-07 06:37:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:43,764 INFO L225 Difference]: With dead ends: 1980 [2020-11-07 06:37:43,765 INFO L226 Difference]: Without dead ends: 1968 [2020-11-07 06:37:43,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 06:37:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2020-11-07 06:37:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1723. [2020-11-07 06:37:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2020-11-07 06:37:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2425 transitions. [2020-11-07 06:37:44,179 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2425 transitions. Word has length 211 [2020-11-07 06:37:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:44,179 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2425 transitions. [2020-11-07 06:37:44,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:37:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2425 transitions. [2020-11-07 06:37:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-11-07 06:37:44,184 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:44,184 INFO L422 BasicCegarLoop]: trace histogram [32, 31, 31, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:44,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-07 06:37:44,184 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:44,185 INFO L82 PathProgramCache]: Analyzing trace with hash -639198092, now seen corresponding path program 7 times [2020-11-07 06:37:44,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:44,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345776192] [2020-11-07 06:37:44,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-11-07 06:37:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-07 06:37:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-11-07 06:37:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:37:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-07 06:37:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-11-07 06:37:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-11-07 06:37:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:37:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-11-07 06:37:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2020-11-07 06:37:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2020-11-07 06:37:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-11-07 06:37:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 06:37:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1978 backedges. 92 proven. 26 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2020-11-07 06:37:44,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345776192] [2020-11-07 06:37:44,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:44,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:37:44,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21443595] [2020-11-07 06:37:44,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:37:44,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:37:44,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:37:44,476 INFO L87 Difference]: Start difference. First operand 1723 states and 2425 transitions. Second operand 16 states. [2020-11-07 06:37:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:47,342 INFO L93 Difference]: Finished difference Result 2235 states and 3165 transitions. [2020-11-07 06:37:47,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 06:37:47,343 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 240 [2020-11-07 06:37:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:47,355 INFO L225 Difference]: With dead ends: 2235 [2020-11-07 06:37:47,355 INFO L226 Difference]: Without dead ends: 2231 [2020-11-07 06:37:47,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=1100, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 06:37:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2020-11-07 06:37:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1723. [2020-11-07 06:37:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2020-11-07 06:37:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2425 transitions. [2020-11-07 06:37:47,646 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2425 transitions. Word has length 240 [2020-11-07 06:37:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:47,646 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2425 transitions. [2020-11-07 06:37:47,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:37:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2425 transitions. [2020-11-07 06:37:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2020-11-07 06:37:47,650 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:47,651 INFO L422 BasicCegarLoop]: trace histogram [34, 33, 33, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:47,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-07 06:37:47,651 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:47,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:47,651 INFO L82 PathProgramCache]: Analyzing trace with hash 473911591, now seen corresponding path program 5 times [2020-11-07 06:37:47,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:47,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1925246372] [2020-11-07 06:37:47,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-11-07 06:37:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:47,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-07 06:37:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-11-07 06:37:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:37:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-07 06:37:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-11-07 06:37:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-11-07 06:37:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:37:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-11-07 06:37:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2020-11-07 06:37:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2020-11-07 06:37:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-11-07 06:37:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 06:37:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2020-11-07 06:37:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2020-11-07 06:37:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 99 proven. 21 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2020-11-07 06:37:48,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1925246372] [2020-11-07 06:37:48,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:48,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 06:37:48,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024016827] [2020-11-07 06:37:48,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 06:37:48,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 06:37:48,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:37:48,090 INFO L87 Difference]: Start difference. First operand 1723 states and 2425 transitions. Second operand 20 states. [2020-11-07 06:37:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:51,417 INFO L93 Difference]: Finished difference Result 1923 states and 2694 transitions. [2020-11-07 06:37:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 06:37:51,417 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 250 [2020-11-07 06:37:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:51,427 INFO L225 Difference]: With dead ends: 1923 [2020-11-07 06:37:51,427 INFO L226 Difference]: Without dead ends: 1911 [2020-11-07 06:37:51,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=362, Invalid=1800, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 06:37:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2020-11-07 06:37:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1813. [2020-11-07 06:37:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813 states. [2020-11-07 06:37:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2550 transitions. [2020-11-07 06:37:51,845 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2550 transitions. Word has length 250 [2020-11-07 06:37:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:51,848 INFO L481 AbstractCegarLoop]: Abstraction has 1813 states and 2550 transitions. [2020-11-07 06:37:51,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 06:37:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2550 transitions. [2020-11-07 06:37:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-11-07 06:37:51,855 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:51,855 INFO L422 BasicCegarLoop]: trace histogram [38, 37, 37, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:51,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-07 06:37:51,856 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:51,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1440966354, now seen corresponding path program 8 times [2020-11-07 06:37:51,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:51,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283754393] [2020-11-07 06:37:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:37:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 06:37:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 06:37:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 06:37:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-11-07 06:37:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:37:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-11-07 06:37:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-11-07 06:37:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2020-11-07 06:37:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-11-07 06:37:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 06:37:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2020-11-07 06:37:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-11-07 06:37:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-11-07 06:37:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2020-11-07 06:37:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2020-11-07 06:37:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2020-11-07 06:37:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2826 backedges. 124 proven. 38 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2020-11-07 06:37:52,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283754393] [2020-11-07 06:37:52,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:52,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 06:37:52,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909941080] [2020-11-07 06:37:52,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 06:37:52,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:52,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 06:37:52,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-11-07 06:37:52,250 INFO L87 Difference]: Start difference. First operand 1813 states and 2550 transitions. Second operand 18 states. [2020-11-07 06:37:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:55,645 INFO L93 Difference]: Finished difference Result 2055 states and 2883 transitions. [2020-11-07 06:37:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 06:37:55,645 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 279 [2020-11-07 06:37:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:55,655 INFO L225 Difference]: With dead ends: 2055 [2020-11-07 06:37:55,655 INFO L226 Difference]: Without dead ends: 2051 [2020-11-07 06:37:55,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=299, Invalid=1423, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 06:37:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2020-11-07 06:37:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1399. [2020-11-07 06:37:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2020-11-07 06:37:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1941 transitions. [2020-11-07 06:37:55,972 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1941 transitions. Word has length 279 [2020-11-07 06:37:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:55,973 INFO L481 AbstractCegarLoop]: Abstraction has 1399 states and 1941 transitions. [2020-11-07 06:37:55,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 06:37:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1941 transitions. [2020-11-07 06:37:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2020-11-07 06:37:55,977 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:37:55,977 INFO L422 BasicCegarLoop]: trace histogram [40, 39, 39, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:37:55,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-07 06:37:55,977 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:37:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:37:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash 12485454, now seen corresponding path program 9 times [2020-11-07 06:37:55,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:37:55,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1286781205] [2020-11-07 06:37:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:37:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:37:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:37:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-11-07 06:37:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:37:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:37:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:37:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:37:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 06:37:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:37:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:37:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:37:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:37:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:37:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-11-07 06:37:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-11-07 06:37:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:37:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:37:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:37:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-11-07 06:37:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 06:37:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:37:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:37:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 06:37:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 06:37:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-11-07 06:37:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-11-07 06:37:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-11-07 06:37:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-11-07 06:37:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-11-07 06:37:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2020-11-07 06:37:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-11-07 06:37:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 06:37:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2020-11-07 06:37:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-11-07 06:37:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-11-07 06:37:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2020-11-07 06:37:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2020-11-07 06:37:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2020-11-07 06:37:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2020-11-07 06:37:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2020-11-07 06:37:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:37:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3134 backedges. 138 proven. 32 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2020-11-07 06:37:56,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1286781205] [2020-11-07 06:37:56,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:37:56,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 06:37:56,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206137363] [2020-11-07 06:37:56,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 06:37:56,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:37:56,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 06:37:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:37:56,444 INFO L87 Difference]: Start difference. First operand 1399 states and 1941 transitions. Second operand 22 states. [2020-11-07 06:38:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:38:00,029 INFO L93 Difference]: Finished difference Result 1497 states and 2067 transitions. [2020-11-07 06:38:00,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-07 06:38:00,029 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 289 [2020-11-07 06:38:00,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:38:00,031 INFO L225 Difference]: With dead ends: 1497 [2020-11-07 06:38:00,031 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:38:00,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=443, Invalid=2209, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 06:38:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:38:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:38:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:38:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:38:00,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2020-11-07 06:38:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:38:00,037 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:38:00,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 06:38:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:38:00,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:38:00,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-07 06:38:00,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:38:01,441 WARN L194 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 307 DAG size of output: 241 [2020-11-07 06:38:01,653 WARN L194 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 122 [2020-11-07 06:38:01,937 WARN L194 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 150 [2020-11-07 06:38:02,204 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 151 [2020-11-07 06:38:03,339 WARN L194 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 375 DAG size of output: 305 [2020-11-07 06:38:03,757 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 157 [2020-11-07 06:38:03,936 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 131 [2020-11-07 06:38:04,380 WARN L194 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 225 [2020-11-07 06:38:04,545 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2020-11-07 06:38:04,687 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 139 [2020-11-07 06:38:05,037 WARN L194 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 185 [2020-11-07 06:38:05,476 WARN L194 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 206 [2020-11-07 06:38:06,380 WARN L194 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 248 [2020-11-07 06:38:06,547 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2020-11-07 06:38:06,710 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2020-11-07 06:38:06,931 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 152 [2020-11-07 06:38:07,631 WARN L194 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 375 DAG size of output: 305 [2020-11-07 06:38:08,215 WARN L194 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 248 [2020-11-07 06:38:10,255 WARN L194 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 550 DAG size of output: 301 [2020-11-07 06:38:10,712 WARN L194 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 205 [2020-11-07 06:38:11,692 WARN L194 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 193 [2020-11-07 06:38:12,032 WARN L194 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 212 [2020-11-07 06:38:12,817 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2020-11-07 06:38:13,063 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 139 [2020-11-07 06:38:14,125 WARN L194 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 425 DAG size of output: 321 [2020-11-07 06:38:15,175 WARN L194 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 248 [2020-11-07 06:38:15,425 WARN L194 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 153 [2020-11-07 06:38:17,260 WARN L194 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 523 DAG size of output: 342 [2020-11-07 06:38:17,742 WARN L194 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 227 [2020-11-07 06:38:17,908 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2020-11-07 06:38:18,453 WARN L194 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 180 [2020-11-07 06:38:18,621 WARN L194 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 150 [2020-11-07 06:38:18,957 WARN L194 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 212 [2020-11-07 06:38:19,120 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2020-11-07 06:38:19,343 WARN L194 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 159 [2020-11-07 06:38:20,452 WARN L194 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 438 DAG size of output: 351 [2020-11-07 06:38:22,348 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 213 DAG size of output: 24 [2020-11-07 06:38:22,634 WARN L194 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 18 [2020-11-07 06:38:23,083 WARN L194 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 21 [2020-11-07 06:38:23,416 WARN L194 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 16 [2020-11-07 06:38:25,332 WARN L194 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 269 DAG size of output: 23 [2020-11-07 06:38:25,554 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 19 [2020-11-07 06:38:25,816 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 25 [2020-11-07 06:38:26,531 WARN L194 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-11-07 06:38:26,868 WARN L194 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 20 [2020-11-07 06:38:27,774 WARN L194 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 31 [2020-11-07 06:38:28,448 WARN L194 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-11-07 06:38:28,814 WARN L194 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 18 [2020-11-07 06:38:29,487 WARN L194 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 26 [2020-11-07 06:38:30,432 WARN L194 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 35 [2020-11-07 06:38:32,057 WARN L194 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 221 DAG size of output: 30 [2020-11-07 06:38:32,745 WARN L194 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-11-07 06:38:33,411 WARN L194 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-11-07 06:38:33,754 WARN L194 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 16 [2020-11-07 06:38:35,689 WARN L194 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 269 DAG size of output: 23 [2020-11-07 06:38:35,921 WARN L194 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 16 [2020-11-07 06:38:37,197 WARN L194 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 224 DAG size of output: 24 [2020-11-07 06:38:37,448 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 17 [2020-11-07 06:38:40,154 WARN L194 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 271 DAG size of output: 25 [2020-11-07 06:38:40,525 WARN L194 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 26 [2020-11-07 06:38:41,372 WARN L194 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 28 [2020-11-07 06:38:42,311 WARN L194 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 23 [2020-11-07 06:38:43,546 WARN L194 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 187 DAG size of output: 27 [2020-11-07 06:38:44,263 WARN L194 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-11-07 06:38:44,677 WARN L194 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 16 [2020-11-07 06:38:46,850 WARN L194 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 296 DAG size of output: 30 [2020-11-07 06:38:48,192 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 224 DAG size of output: 24 [2020-11-07 06:38:48,423 WARN L194 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 16 [2020-11-07 06:38:48,850 WARN L194 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 23 [2020-11-07 06:38:49,146 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 16 [2020-11-07 06:38:52,678 WARN L194 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 310 DAG size of output: 26 [2020-11-07 06:38:52,944 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 16 [2020-11-07 06:38:54,362 WARN L194 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 205 DAG size of output: 23 [2020-11-07 06:38:55,039 WARN L194 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-11-07 06:38:55,914 WARN L194 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 25 [2020-11-07 06:38:56,372 WARN L194 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 22 [2020-11-07 06:38:57,413 WARN L194 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 192 DAG size of output: 32 [2020-11-07 06:38:58,092 WARN L194 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-11-07 06:38:58,617 WARN L194 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 20 [2020-11-07 06:39:00,838 WARN L194 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 316 DAG size of output: 37 [2020-11-07 06:39:01,121 WARN L194 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 16 [2020-11-07 06:39:01,129 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,129 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,129 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,130 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,130 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,130 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,130 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:01,130 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:01,130 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,130 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,130 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,130 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,131 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-11-07 06:39:01,131 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:39:01,131 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:39:01,131 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:39:01,131 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:01,131 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:39:01,131 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:39:01,131 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-07 06:39:01,131 INFO L266 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-11-07 06:39:01,131 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:01,132 INFO L266 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:01,132 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:01,132 INFO L262 CegarLoopResult]: At program point L35-3(lines 35 64) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 1 main_~j~0) (<= 1 main_~i~0) .cse0) (and (<= (+ main_~i~0 1) main_~len~0) (= main_~j~0 0) (<= 0 main_~i~0) .cse0) (and (<= 2 main_~len~0) (<= main_~len~0 main_~i~0) .cse0))) [2020-11-07 06:39:01,132 INFO L269 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-11-07 06:39:01,132 INFO L269 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-11-07 06:39:01,132 INFO L262 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (let ((.cse1 (= main_~j~0 0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (< main_~i~0 main_~len~0)) (.cse3 (<= 1 main_~i~0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= main_~len~0 (+ main_~i~0 1)) .cse3 .cse2 .cse4) (and .cse0 (= main_~i~0 0) .cse1 .cse2 .cse4) (and (<= 1 main_~j~0) .cse0 .cse2 .cse3 .cse4))) [2020-11-07 06:39:01,132 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 06:39:01,132 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 24 67) the Hoare annotation is: true [2020-11-07 06:39:01,133 INFO L262 CegarLoopResult]: At program point L56(lines 36 63) the Hoare annotation is: (let ((.cse1 (<= 1 main_~j~0)) (.cse3 (+ main_~i~0 1)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (< main_~i~0 main_~len~0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 (<= 2 main_~len~0) .cse2 (<= main_~len~0 .cse3) .cse4) (and .cse0 .cse1 (<= 1 main_~i~0) (< .cse3 main_~len~0) .cse4) (and .cse0 (= main_~j~0 0) .cse2 (<= 0 main_~i~0) .cse4))) [2020-11-07 06:39:01,133 INFO L262 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= 2 main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-11-07 06:39:01,133 INFO L262 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= 2 main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-11-07 06:39:01,133 INFO L262 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-11-07 06:39:01,133 INFO L262 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse5 (<= 1 main_~i~0)) (.cse1 (= main_~j~0 0)) (.cse2 (= |main_#t~post6| 0)) (.cse3 (< (+ main_~i~0 1) main_~len~0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (= main_~i~0 0) .cse1 .cse2 .cse3 .cse4) (and (<= 1 main_~j~0) .cse0 .cse5 (<= (+ |main_#t~post6| 5) main_~bufsize~0) .cse3 .cse4 (<= 1 |main_#t~post6|)) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse4))) [2020-11-07 06:39:01,134 INFO L262 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (let ((.cse0 (<= 1 main_~j~0)) (.cse2 (= |main_#t~post6| 0)) (.cse1 (<= 1 main_~i~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse4 (<= (+ main_~j~0 4) main_~bufsize~0))) (or (and .cse0 (<= (+ main_~i~0 2) main_~len~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse2 .cse3 .cse4) (and .cse1 (<= (+ |main_#t~post6| 5) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) .cse3 (<= 1 |main_#t~post6|) (<= 2 main_~j~0) .cse4))) [2020-11-07 06:39:01,134 INFO L262 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse3 (< (+ main_~i~0 1) main_~len~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (= main_~j~0 0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 main_~j~0) .cse1 .cse3 .cse4) (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse2 .cse4))) [2020-11-07 06:39:01,134 INFO L262 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse3 (< (+ main_~i~0 1) main_~len~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (= main_~j~0 0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 main_~j~0) .cse1 .cse3 .cse4) (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse2 .cse4))) [2020-11-07 06:39:01,134 INFO L262 CegarLoopResult]: At program point L36(lines 36 63) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (< main_~i~0 main_~len~0)) (.cse2 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (<= 1 main_~j~0) (<= 1 main_~i~0) .cse1 .cse2) (and .cse0 (= main_~j~0 0) .cse1 (<= 0 main_~i~0) .cse2))) [2020-11-07 06:39:01,134 INFO L269 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-11-07 06:39:01,135 INFO L269 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: true [2020-11-07 06:39:01,135 INFO L269 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: true [2020-11-07 06:39:01,135 INFO L262 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse1 (= main_~j~0 0)) (.cse3 (= 0 |main_#t~post11|)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse5 (<= 1 main_~i~0)) (.cse2 (< main_~i~0 main_~len~0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (= main_~i~0 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 (<= (+ main_~i~0 2) main_~len~0) .cse1 .cse3 .cse4) (and .cse0 (<= main_~len~0 (+ main_~i~0 1)) .cse5 .cse2 .cse4) (and (<= 1 main_~j~0) .cse0 .cse5 .cse2 .cse4 (<= 1 |main_#t~post11|)))) [2020-11-07 06:39:01,135 INFO L269 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-11-07 06:39:01,135 INFO L262 CegarLoopResult]: At program point L61-1(line 61) the Hoare annotation is: (let ((.cse0 (<= 1 main_~j~0)) (.cse2 (= 0 |main_#t~post11|)) (.cse1 (< main_~i~0 main_~len~0)) (.cse4 (<= (+ main_~i~0 2) main_~len~0)) (.cse5 (<= 1 main_~i~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (= main_~i~0 0) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2 .cse3) (and (<= main_~len~0 (+ main_~i~0 1)) .cse1 .cse5 .cse3) (and .cse4 .cse5 .cse3 (<= 2 main_~j~0) (<= 1 |main_#t~post11|)))) [2020-11-07 06:39:01,135 INFO L262 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse4 (= main_~j~0 0)) (.cse2 (< main_~i~0 main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (<= 1 main_~j~0) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3) (and .cse0 (= main_~i~0 0) .cse4 .cse2 .cse3))) [2020-11-07 06:39:01,136 INFO L262 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= 2 main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-11-07 06:39:01,136 INFO L262 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-11-07 06:39:01,136 INFO L262 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 (<= 1 main_~j~0)) (.cse1 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse2 (<= (+ main_~j~0 4) main_~bufsize~0))) (or (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse1 .cse2) (and .cse0 (<= 1 main_~i~0) (< (+ main_~i~0 1) main_~len~0) .cse1 .cse2))) [2020-11-07 06:39:01,136 INFO L262 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 (<= 1 main_~j~0)) (.cse1 (<= (+ |main_#t~post7| 2) main_~len~0)) (.cse2 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse3 (<= (+ main_~j~0 4) main_~bufsize~0))) (or (and .cse0 (= |main_#t~post7| 0) (= main_~i~0 0) .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 1 main_~i~0) (<= 1 |main_#t~post7|) (< (+ main_~i~0 1) main_~len~0) .cse2 .cse3))) [2020-11-07 06:39:01,136 INFO L262 CegarLoopResult]: At program point L45-2(line 45) the Hoare annotation is: (let ((.cse0 (<= 1 main_~j~0)) (.cse1 (<= (+ main_~i~0 1) main_~len~0)) (.cse2 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse3 (<= (+ main_~j~0 4) main_~bufsize~0))) (or (and .cse0 (<= 2 main_~i~0) .cse1 (<= (+ |main_#t~post7| 2) main_~len~0) (<= 1 |main_#t~post7|) .cse2 .cse3) (and .cse0 (= |main_#t~post7| 0) .cse1 (<= 1 main_~i~0) .cse2 .cse3))) [2020-11-07 06:39:01,136 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= 0 main_~j~0)) (.cse2 (< (+ main_~i~0 1) main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 (= main_~i~0 0) (= main_~j~0 0) .cse2 .cse3) (and .cse0 .cse1 (<= 1 main_~i~0) .cse2 .cse3))) [2020-11-07 06:39:01,137 INFO L262 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse3 (< (+ main_~i~0 1) main_~len~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (= main_~j~0 0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 main_~j~0) .cse1 .cse3 .cse4) (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse2 .cse4))) [2020-11-07 06:39:01,137 INFO L262 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse3 (< (+ main_~i~0 1) main_~len~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (= main_~j~0 0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 main_~j~0) .cse1 .cse3 .cse4) (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse2 .cse4))) [2020-11-07 06:39:01,137 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 06:39:01,137 INFO L262 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (< main_~i~0 main_~len~0)) (.cse3 (<= 1 main_~j~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= main_~len~0 (+ main_~i~0 1)) .cse0 .cse1 .cse2) (and .cse3 (= main_~i~0 0) .cse0 .cse2) (and .cse3 (<= (+ main_~i~0 2) main_~len~0) .cse1 .cse2))) [2020-11-07 06:39:01,137 INFO L269 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-11-07 06:39:01,137 INFO L262 CegarLoopResult]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse0 (<= 1 main_~j~0)) (.cse1 (< main_~i~0 main_~len~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (= 0 |main_#t~post12|) (= main_~i~0 0) .cse1 .cse2) (and .cse0 (<= 1 |main_#t~post12|) (<= (+ main_~i~0 2) main_~len~0) .cse3 .cse2) (and .cse1 .cse3 (<= main_~len~0 (+ main_~i~0 1)) (<= main_~len~0 (+ |main_#t~post12| 1)) .cse2))) [2020-11-07 06:39:01,138 INFO L262 CegarLoopResult]: At program point L62-2(line 62) the Hoare annotation is: (let ((.cse0 (<= 1 main_~j~0)) (.cse1 (<= 2 main_~len~0)) (.cse2 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (<= 2 main_~i~0) (<= 1 |main_#t~post12|) .cse1 .cse2) (and .cse0 (= 0 |main_#t~post12|) (<= 1 main_~i~0) .cse2) (and .cse1 (<= main_~len~0 (+ |main_#t~post12| 1)) (<= main_~len~0 main_~i~0) .cse2))) [2020-11-07 06:39:01,138 INFO L262 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse4 (<= 1 main_~i~0)) (.cse2 (= main_~j~0 0)) (.cse1 (< main_~i~0 main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (= main_~i~0 0) .cse1 .cse2 .cse3) (and .cse0 (<= 1 main_~j~0) .cse4 .cse1 .cse3) (and .cse0 .cse4 .cse2 .cse1 .cse3))) [2020-11-07 06:39:01,138 INFO L262 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= 2 main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 |main_#t~post10|) (<= 2 main_~j~0)) [2020-11-07 06:39:01,138 INFO L262 CegarLoopResult]: At program point L54-1(line 54) the Hoare annotation is: (and (<= 2 main_~i~0) (<= 3 main_~j~0) (<= 2 main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 |main_#t~post10|)) [2020-11-07 06:39:01,138 INFO L262 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ |main_#t~post8| 4) main_~bufsize~0) (<= 1 |main_#t~post8|) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-11-07 06:39:01,138 INFO L262 CegarLoopResult]: At program point L50-1(line 50) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= (+ |main_#t~post8| 4) main_~bufsize~0) (<= 1 |main_#t~post8|)) [2020-11-07 06:39:01,138 INFO L262 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-11-07 06:39:01,138 INFO L262 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-11-07 06:39:01,138 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 24 67) the Hoare annotation is: true [2020-11-07 06:39:01,139 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse1 (<= 0 main_~j~0)) (.cse2 (< (+ main_~i~0 1) main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 (= main_~i~0 0) (= main_~j~0 0) .cse2 .cse3) (and .cse0 .cse1 (<= 1 main_~i~0) .cse2 .cse3))) [2020-11-07 06:39:01,139 INFO L262 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse3 (< (+ main_~i~0 1) main_~len~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (= main_~j~0 0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 main_~j~0) .cse1 .cse3 .cse4) (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse2 .cse4))) [2020-11-07 06:39:01,139 INFO L262 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (<= (+ main_~limit~0 4) main_~bufsize~0) [2020-11-07 06:39:01,139 INFO L262 CegarLoopResult]: At program point L34-3(lines 34 65) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (let ((.cse1 (<= 1 main_~i~0))) (or (and (= main_~j~0 0) .cse1) (and (<= 1 main_~j~0) .cse1)))) (and (<= 2 main_~i~0) (<= 2 main_~len~0) .cse0) (and (= main_~i~0 0) .cse0))) [2020-11-07 06:39:01,139 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 06:39:01,139 INFO L269 CegarLoopResult]: At program point L34-4(lines 34 65) the Hoare annotation is: true [2020-11-07 06:39:01,139 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2020-11-07 06:39:01,139 INFO L269 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-11-07 06:39:01,139 INFO L269 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: true [2020-11-07 06:39:01,140 INFO L262 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse4 (<= 1 main_~i~0)) (.cse2 (= main_~j~0 0)) (.cse1 (< main_~i~0 main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 (= main_~i~0 0) .cse1 .cse2 .cse3) (and .cse0 (<= 1 main_~j~0) .cse4 .cse1 .cse3) (and .cse0 .cse4 .cse2 .cse1 .cse3))) [2020-11-07 06:39:01,140 INFO L262 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-11-07 06:39:01,140 INFO L262 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= 1 |main_#t~post9|) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-11-07 06:39:01,140 INFO L262 CegarLoopResult]: At program point L51-2(line 51) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 2 main_~i~0) (<= 2 main_~len~0) (<= 1 |main_#t~post9|) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0)) [2020-11-07 06:39:01,140 INFO L262 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (and (<= 1 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2020-11-07 06:39:01,140 INFO L262 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse4 (= main_~j~0 0)) (.cse2 (< (+ main_~i~0 1) main_~len~0)) (.cse3 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 1 main_~j~0) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3) (and .cse0 (= main_~i~0 0) .cse4 .cse2 .cse3))) [2020-11-07 06:39:01,140 INFO L262 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse3 (< (+ main_~i~0 1) main_~len~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (= main_~j~0 0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 main_~j~0) .cse1 .cse3 .cse4) (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse2 .cse4))) [2020-11-07 06:39:01,140 INFO L262 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse3 (< (+ main_~i~0 1) main_~len~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (= main_~j~0 0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 main_~j~0) .cse1 .cse3 .cse4) (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse2 .cse4))) [2020-11-07 06:39:01,140 INFO L262 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0)) (.cse3 (< (+ main_~i~0 1) main_~len~0)) (.cse0 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse2 (= main_~j~0 0)) (.cse4 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 main_~j~0) .cse1 .cse3 .cse4) (and .cse0 (<= 2 main_~len~0) (= main_~i~0 0) .cse2 .cse4))) [2020-11-07 06:39:01,141 INFO L262 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (< main_~i~0 main_~len~0)) (.cse1 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 2 main_~i~0) .cse0 .cse1) (and (let ((.cse2 (<= 1 main_~i~0))) (or (and .cse0 .cse2 (= main_~j~0 0)) (and (<= 1 main_~j~0) .cse0 .cse2))) .cse1) (and (= main_~i~0 0) .cse0 .cse1))) [2020-11-07 06:39:01,141 INFO L262 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:01,141 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-07 06:39:01,141 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:01,141 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:39:01,141 INFO L262 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:01,141 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:39:01,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:39:01 BoogieIcfgContainer [2020-11-07 06:39:01,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:39:01,164 INFO L168 Benchmark]: Toolchain (without parser) took 147423.02 ms. Allocated memory was 151.0 MB in the beginning and 941.6 MB in the end (delta: 790.6 MB). Free memory was 127.1 MB in the beginning and 626.8 MB in the end (delta: -499.7 MB). Peak memory consumption was 591.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:01,164 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:39:01,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.91 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 116.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:01,165 INFO L168 Benchmark]: Boogie Preprocessor took 72.39 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 114.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:01,165 INFO L168 Benchmark]: RCFGBuilder took 770.87 ms. Allocated memory is still 151.0 MB. Free memory was 114.7 MB in the beginning and 128.8 MB in the end (delta: -14.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:01,166 INFO L168 Benchmark]: TraceAbstraction took 146277.70 ms. Allocated memory was 151.0 MB in the beginning and 941.6 MB in the end (delta: 790.6 MB). Free memory was 128.3 MB in the beginning and 626.8 MB in the end (delta: -498.5 MB). Peak memory consumption was 591.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:01,168 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 281.91 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 116.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 72.39 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 114.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 770.87 ms. Allocated memory is still 151.0 MB. Free memory was 114.7 MB in the beginning and 128.8 MB in the end (delta: -14.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 146277.70 ms. Allocated memory was 151.0 MB in the beginning and 941.6 MB in the end (delta: 790.6 MB). Free memory was 128.3 MB in the beginning and 626.8 MB in the end (delta: -498.5 MB). Peak memory consumption was 591.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((j + 5 <= bufsize && 1 <= j) && 2 <= len) && i < len) && len <= i + 1) && limit + 4 <= bufsize) || ((((j + 5 <= bufsize && 1 <= j) && 1 <= i) && i + 1 < len) && limit + 4 <= bufsize)) || ((((j + 5 <= bufsize && j == 0) && i < len) && 0 <= i) && limit + 4 <= bufsize) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((limit + 4 <= bufsize && ((j == 0 && 1 <= i) || (1 <= j && 1 <= i))) || ((2 <= i && 2 <= len) && limit + 4 <= bufsize)) || (i == 0 && limit + 4 <= bufsize) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((1 <= j && 1 <= i) && limit + 4 <= bufsize) || (((i + 1 <= len && j == 0) && 0 <= i) && limit + 4 <= bufsize)) || ((2 <= len && len <= i) && limit + 4 <= bufsize) - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 85.0s, OverallIterations: 45, TraceHistogramMax: 40, AutomataDifference: 70.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 61.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4814 SDtfs, 5570 SDslu, 13652 SDs, 0 SdLazy, 43449 SolverSat, 4780 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2653 GetRequests, 1672 SyntacticMatches, 0 SemanticMatches, 981 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4479 ImplicationChecksByTransitivity, 21.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1813occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 45 MinimizatonAttempts, 3026 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 4761 PreInvPairs, 7285 NumberOfFragments, 2278 HoareAnnotationTreeSize, 4761 FomulaSimplifications, 84194618918042 FormulaSimplificationTreeSizeReduction, 21.2s HoareSimplificationTime, 87 FomulaSimplificationsInter, 3410072923 FormulaSimplificationTreeSizeReductionInter, 39.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 6253 NumberOfCodeBlocks, 6253 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 6208 ConstructedInterpolants, 0 QuantifiedInterpolants, 1964506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 13 PerfectInterpolantSequences, 31810/32299 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...