/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/loops-crafted-1/sumt9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:49:36,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:49:36,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:49:36,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:49:36,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:49:36,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:49:36,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:49:36,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:49:36,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:49:36,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:49:36,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:49:36,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:49:36,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:49:36,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:49:36,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:49:36,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:49:36,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:49:36,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:49:36,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:49:36,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:49:36,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:49:36,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:49:36,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:49:36,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:49:36,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:49:36,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:49:36,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:49:36,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:49:36,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:49:36,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:49:36,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:49:36,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:49:36,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:49:36,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:49:36,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:49:36,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:49:36,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:49:36,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:49:36,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:49:36,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:49:36,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:49:36,350 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:49:36,374 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:49:36,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:49:36,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:49:36,382 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:49:36,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:49:36,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:49:36,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:49:36,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:49:36,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:49:36,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:49:36,385 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:49:36,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:49:36,385 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:49:36,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:49:36,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:49:36,388 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:49:36,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:49:36,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:49:36,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:49:36,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:49:36,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:49:36,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:49:36,389 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:49:36,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:49:36,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:49:36,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:49:36,914 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:49:36,915 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:49:36,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt9.c [2020-11-07 06:49:37,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d95f2d73/b1c3ec5e0f1c45b19bc96b277316932e/FLAGa4e97afa5 [2020-11-07 06:49:37,769 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:49:37,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c [2020-11-07 06:49:37,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d95f2d73/b1c3ec5e0f1c45b19bc96b277316932e/FLAGa4e97afa5 [2020-11-07 06:49:38,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d95f2d73/b1c3ec5e0f1c45b19bc96b277316932e [2020-11-07 06:49:38,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:49:38,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:49:38,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:38,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:49:38,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:49:38,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:38" (1/1) ... [2020-11-07 06:49:38,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521f5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38, skipping insertion in model container [2020-11-07 06:49:38,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:38" (1/1) ... [2020-11-07 06:49:38,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:49:38,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:49:38,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:38,421 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:49:38,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:38,467 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:49:38,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38 WrapperNode [2020-11-07 06:49:38,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:38,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:49:38,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:49:38,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:49:38,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38" (1/1) ... [2020-11-07 06:49:38,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38" (1/1) ... [2020-11-07 06:49:38,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38" (1/1) ... [2020-11-07 06:49:38,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38" (1/1) ... [2020-11-07 06:49:38,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38" (1/1) ... [2020-11-07 06:49:38,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38" (1/1) ... [2020-11-07 06:49:38,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38" (1/1) ... [2020-11-07 06:49:38,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:49:38,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:49:38,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:49:38,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:49:38,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38" (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:49:38,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:49:38,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:49:38,630 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:49:38,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:49:38,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:49:38,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:49:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:49:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:49:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:49:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:49:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:49:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:49:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:49:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:49:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:49:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:49:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:49:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:49:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:49:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:49:39,442 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:49:39,442 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 06:49:39,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:39 BoogieIcfgContainer [2020-11-07 06:49:39,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:49:39,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:49:39,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:49:39,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:49:39,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:49:38" (1/3) ... [2020-11-07 06:49:39,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e74714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:39, skipping insertion in model container [2020-11-07 06:49:39,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:38" (2/3) ... [2020-11-07 06:49:39,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e74714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:39, skipping insertion in model container [2020-11-07 06:49:39,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:39" (3/3) ... [2020-11-07 06:49:39,464 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt9.c [2020-11-07 06:49:39,488 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:49:39,495 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:49:39,515 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:49:39,565 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:49:39,565 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:49:39,566 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:49:39,566 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:49:39,566 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:49:39,566 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:49:39,567 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:49:39,567 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:49:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2020-11-07 06:49:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-07 06:49:39,621 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:39,622 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, 1, 1, 1] [2020-11-07 06:49:39,623 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1798983212, now seen corresponding path program 1 times [2020-11-07 06:49:39,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:39,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070444544] [2020-11-07 06:49:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:40,837 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2020-11-07 06:49:40,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:40,961 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:49:40,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2070444544] [2020-11-07 06:49:40,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:49:40,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 06:49:40,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574247780] [2020-11-07 06:49:40,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 06:49:40,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:40,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 06:49:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:49:40,995 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 17 states. [2020-11-07 06:49:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:42,915 INFO L93 Difference]: Finished difference Result 198 states and 272 transitions. [2020-11-07 06:49:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 06:49:42,918 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2020-11-07 06:49:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:42,932 INFO L225 Difference]: With dead ends: 198 [2020-11-07 06:49:42,933 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 06:49:42,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2020-11-07 06:49:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 06:49:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 64. [2020-11-07 06:49:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 06:49:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2020-11-07 06:49:43,025 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 37 [2020-11-07 06:49:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:43,026 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2020-11-07 06:49:43,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 06:49:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2020-11-07 06:49:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-07 06:49:43,028 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:43,029 INFO L422 BasicCegarLoop]: trace histogram [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:49:43,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:49:43,029 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:43,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1332374799, now seen corresponding path program 1 times [2020-11-07 06:49:43,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:43,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [880593024] [2020-11-07 06:49:43,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:43,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:43,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:49:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:43,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [880593024] [2020-11-07 06:49:43,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:43,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:43,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677964110] [2020-11-07 06:49:43,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:43,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:43,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:43,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:43,344 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 5 states. [2020-11-07 06:49:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:43,948 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2020-11-07 06:49:43,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:43,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-11-07 06:49:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:43,955 INFO L225 Difference]: With dead ends: 109 [2020-11-07 06:49:43,955 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 06:49:43,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 06:49:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2020-11-07 06:49:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-07 06:49:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2020-11-07 06:49:44,018 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 46 [2020-11-07 06:49:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:44,019 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2020-11-07 06:49:44,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2020-11-07 06:49:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-07 06:49:44,025 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:44,025 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:49:44,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:49:44,026 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:44,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2032386084, now seen corresponding path program 1 times [2020-11-07 06:49:44,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:44,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1894036340] [2020-11-07 06:49:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:44,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:44,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:49:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:44,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1894036340] [2020-11-07 06:49:44,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:44,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:44,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259263359] [2020-11-07 06:49:44,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:44,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:44,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:44,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:44,308 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 5 states. [2020-11-07 06:49:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:44,736 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2020-11-07 06:49:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:44,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2020-11-07 06:49:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:44,739 INFO L225 Difference]: With dead ends: 108 [2020-11-07 06:49:44,739 INFO L226 Difference]: Without dead ends: 81 [2020-11-07 06:49:44,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-07 06:49:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2020-11-07 06:49:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 06:49:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2020-11-07 06:49:44,774 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 47 [2020-11-07 06:49:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:44,775 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2020-11-07 06:49:44,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-11-07 06:49:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-07 06:49:44,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:44,777 INFO L422 BasicCegarLoop]: trace histogram [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:49:44,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:49:44,777 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:44,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash -4154153, now seen corresponding path program 1 times [2020-11-07 06:49:44,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:44,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620133482] [2020-11-07 06:49:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:49:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:45,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620133482] [2020-11-07 06:49:45,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:45,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:45,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893085476] [2020-11-07 06:49:45,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:45,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:45,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:45,107 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 5 states. [2020-11-07 06:49:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:45,676 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2020-11-07 06:49:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:45,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-11-07 06:49:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:45,679 INFO L225 Difference]: With dead ends: 107 [2020-11-07 06:49:45,684 INFO L226 Difference]: Without dead ends: 80 [2020-11-07 06:49:45,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-07 06:49:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-11-07 06:49:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-07 06:49:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2020-11-07 06:49:45,763 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 48 [2020-11-07 06:49:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:45,764 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2020-11-07 06:49:45,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2020-11-07 06:49:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 06:49:45,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:45,777 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:49:45,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:49:45,777 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:45,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1977304566, now seen corresponding path program 1 times [2020-11-07 06:49:45,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:45,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68780746] [2020-11-07 06:49:45,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:46,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:46,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:49:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:46,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68780746] [2020-11-07 06:49:46,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:46,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:46,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89069224] [2020-11-07 06:49:46,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:46,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:46,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:46,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:46,379 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 9 states. [2020-11-07 06:49:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:47,372 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2020-11-07 06:49:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:49:47,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 06:49:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:47,375 INFO L225 Difference]: With dead ends: 106 [2020-11-07 06:49:47,376 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 06:49:47,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:49:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 06:49:47,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2020-11-07 06:49:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 06:49:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2020-11-07 06:49:47,439 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 49 [2020-11-07 06:49:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:47,441 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2020-11-07 06:49:47,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2020-11-07 06:49:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-07 06:49:47,445 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:47,446 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:49:47,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:49:47,446 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:47,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1985370435, now seen corresponding path program 1 times [2020-11-07 06:49:47,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:47,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [699664414] [2020-11-07 06:49:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:48,516 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2020-11-07 06:49:48,800 WARN L194 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-11-07 06:49:48,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:49,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:49:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:49,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [699664414] [2020-11-07 06:49:49,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:49,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 06:49:49,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401830390] [2020-11-07 06:49:49,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 06:49:49,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:49,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 06:49:49,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:49:49,096 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 20 states. [2020-11-07 06:49:49,413 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-11-07 06:49:49,920 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-11-07 06:49:50,087 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-11-07 06:49:50,253 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-11-07 06:49:50,447 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-11-07 06:49:50,616 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2020-11-07 06:49:50,815 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-11-07 06:49:51,072 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2020-11-07 06:49:51,429 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2020-11-07 06:49:51,835 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-11-07 06:49:52,178 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-11-07 06:49:52,345 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-11-07 06:49:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:59,372 INFO L93 Difference]: Finished difference Result 168 states and 215 transitions. [2020-11-07 06:49:59,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 06:49:59,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2020-11-07 06:49:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:59,376 INFO L225 Difference]: With dead ends: 168 [2020-11-07 06:49:59,377 INFO L226 Difference]: Without dead ends: 141 [2020-11-07 06:49:59,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=384, Invalid=1022, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 06:49:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-07 06:49:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 70. [2020-11-07 06:49:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-07 06:49:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-11-07 06:49:59,432 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 50 [2020-11-07 06:49:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:59,432 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-11-07 06:49:59,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 06:49:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-11-07 06:49:59,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-07 06:49:59,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:59,434 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:49:59,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:49:59,435 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:59,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1205357584, now seen corresponding path program 1 times [2020-11-07 06:49:59,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:59,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1173070916] [2020-11-07 06:49:59,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:59,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:59,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:49:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:59,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1173070916] [2020-11-07 06:49:59,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:59,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:59,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401081086] [2020-11-07 06:49:59,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:59,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:59,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:59,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:59,626 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 5 states. [2020-11-07 06:50:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:00,070 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2020-11-07 06:50:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:50:00,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-11-07 06:50:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:00,073 INFO L225 Difference]: With dead ends: 104 [2020-11-07 06:50:00,074 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 06:50:00,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:50:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 06:50:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2020-11-07 06:50:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-07 06:50:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2020-11-07 06:50:00,129 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 51 [2020-11-07 06:50:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:00,129 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2020-11-07 06:50:00,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:50:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-11-07 06:50:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 06:50:00,131 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:00,131 INFO L422 BasicCegarLoop]: trace histogram [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:50:00,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:50:00,131 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1764708189, now seen corresponding path program 1 times [2020-11-07 06:50:00,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:00,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543038721] [2020-11-07 06:50:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:01,323 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2020-11-07 06:50:01,627 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-11-07 06:50:01,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:01,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:50:01,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543038721] [2020-11-07 06:50:01,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:01,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 06:50:01,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352630715] [2020-11-07 06:50:01,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 06:50:01,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 06:50:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:50:01,930 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 20 states. [2020-11-07 06:50:02,631 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2020-11-07 06:50:02,768 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-11-07 06:50:02,921 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-11-07 06:50:03,083 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-11-07 06:50:03,252 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-11-07 06:50:03,466 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2020-11-07 06:50:03,696 WARN L194 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-11-07 06:50:03,966 WARN L194 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2020-11-07 06:50:04,320 WARN L194 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2020-11-07 06:50:04,698 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-11-07 06:50:04,870 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-11-07 06:50:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:09,889 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2020-11-07 06:50:09,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 06:50:09,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2020-11-07 06:50:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:09,892 INFO L225 Difference]: With dead ends: 145 [2020-11-07 06:50:09,892 INFO L226 Difference]: Without dead ends: 118 [2020-11-07 06:50:09,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 06:50:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-07 06:50:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 72. [2020-11-07 06:50:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 06:50:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2020-11-07 06:50:09,940 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 52 [2020-11-07 06:50:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:09,940 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2020-11-07 06:50:09,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 06:50:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2020-11-07 06:50:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 06:50:09,941 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:09,941 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:50:09,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:50:09,942 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -894652970, now seen corresponding path program 1 times [2020-11-07 06:50:09,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:09,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [413799696] [2020-11-07 06:50:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:10,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:10,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:50:10,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [413799696] [2020-11-07 06:50:10,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:10,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:50:10,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324940984] [2020-11-07 06:50:10,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:50:10,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:10,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:50:10,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:50:10,075 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 5 states. [2020-11-07 06:50:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:10,549 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2020-11-07 06:50:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:50:10,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-11-07 06:50:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:10,551 INFO L225 Difference]: With dead ends: 102 [2020-11-07 06:50:10,551 INFO L226 Difference]: Without dead ends: 75 [2020-11-07 06:50:10,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:50:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-07 06:50:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-11-07 06:50:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-07 06:50:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2020-11-07 06:50:10,596 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 53 [2020-11-07 06:50:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:10,596 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2020-11-07 06:50:10,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:50:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2020-11-07 06:50:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 06:50:10,597 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:10,597 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:50:10,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:50:10,598 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:10,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1593645514, now seen corresponding path program 1 times [2020-11-07 06:50:10,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:10,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183198594] [2020-11-07 06:50:10,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:11,247 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2020-11-07 06:50:11,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:11,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:50:11,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183198594] [2020-11-07 06:50:11,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:11,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 06:50:11,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183955003] [2020-11-07 06:50:11,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 06:50:11,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:11,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 06:50:11,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:50:11,362 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 19 states. [2020-11-07 06:50:12,878 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-07 06:50:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:13,481 INFO L93 Difference]: Finished difference Result 121 states and 146 transitions. [2020-11-07 06:50:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 06:50:13,482 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2020-11-07 06:50:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:13,484 INFO L225 Difference]: With dead ends: 121 [2020-11-07 06:50:13,484 INFO L226 Difference]: Without dead ends: 118 [2020-11-07 06:50:13,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 06:50:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-07 06:50:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2020-11-07 06:50:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 06:50:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2020-11-07 06:50:13,530 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 53 [2020-11-07 06:50:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:13,531 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2020-11-07 06:50:13,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 06:50:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2020-11-07 06:50:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 06:50:13,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:13,532 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:13,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:50:13,532 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:13,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2012205873, now seen corresponding path program 2 times [2020-11-07 06:50:13,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:13,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302516919] [2020-11-07 06:50:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:13,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:13,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:14,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:50:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:14,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302516919] [2020-11-07 06:50:14,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:14,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:50:14,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008360785] [2020-11-07 06:50:14,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:50:14,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:50:14,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:50:14,027 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 10 states. [2020-11-07 06:50:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:15,168 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2020-11-07 06:50:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:50:15,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2020-11-07 06:50:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:15,171 INFO L225 Difference]: With dead ends: 125 [2020-11-07 06:50:15,171 INFO L226 Difference]: Without dead ends: 98 [2020-11-07 06:50:15,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:50:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-07 06:50:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2020-11-07 06:50:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 06:50:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2020-11-07 06:50:15,208 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 62 [2020-11-07 06:50:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:15,208 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2020-11-07 06:50:15,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:50:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2020-11-07 06:50:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 06:50:15,209 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:15,210 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:15,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:50:15,210 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:15,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1862508026, now seen corresponding path program 1 times [2020-11-07 06:50:15,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:15,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580902742] [2020-11-07 06:50:15,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:15,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:15,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:15,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:50:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:15,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580902742] [2020-11-07 06:50:15,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:15,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:50:15,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570762674] [2020-11-07 06:50:15,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:50:15,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:15,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:50:15,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:50:15,394 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 6 states. [2020-11-07 06:50:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:16,033 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2020-11-07 06:50:16,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:50:16,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2020-11-07 06:50:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:16,036 INFO L225 Difference]: With dead ends: 124 [2020-11-07 06:50:16,036 INFO L226 Difference]: Without dead ends: 97 [2020-11-07 06:50:16,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:50:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-07 06:50:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2020-11-07 06:50:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 06:50:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2020-11-07 06:50:16,084 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 63 [2020-11-07 06:50:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:16,085 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2020-11-07 06:50:16,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:50:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2020-11-07 06:50:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 06:50:16,086 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:16,086 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:50:16,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:50:16,086 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:16,087 INFO L82 PathProgramCache]: Analyzing trace with hash -486787275, now seen corresponding path program 1 times [2020-11-07 06:50:16,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:16,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [779550831] [2020-11-07 06:50:16,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:16,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:16,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:16,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:50:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:16,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [779550831] [2020-11-07 06:50:16,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:16,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:50:16,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860098357] [2020-11-07 06:50:16,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:50:16,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:16,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:50:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:50:16,333 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 6 states. [2020-11-07 06:50:17,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:17,144 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2020-11-07 06:50:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:50:17,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2020-11-07 06:50:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:17,146 INFO L225 Difference]: With dead ends: 123 [2020-11-07 06:50:17,146 INFO L226 Difference]: Without dead ends: 96 [2020-11-07 06:50:17,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:50:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-07 06:50:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2020-11-07 06:50:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-07 06:50:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2020-11-07 06:50:17,209 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 64 [2020-11-07 06:50:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:17,209 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2020-11-07 06:50:17,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:50:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2020-11-07 06:50:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 06:50:17,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:17,211 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-11-07 06:50:17,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 06:50:17,211 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash 240937836, now seen corresponding path program 1 times [2020-11-07 06:50:17,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:17,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1324751575] [2020-11-07 06:50:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:17,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:17,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:17,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:50:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:17,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1324751575] [2020-11-07 06:50:17,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:17,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:50:17,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69160126] [2020-11-07 06:50:18,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:50:18,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:18,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:50:18,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:18,004 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 11 states. [2020-11-07 06:50:18,450 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:50:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:37,105 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2020-11-07 06:50:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:50:37,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 06:50:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:37,107 INFO L225 Difference]: With dead ends: 122 [2020-11-07 06:50:37,107 INFO L226 Difference]: Without dead ends: 95 [2020-11-07 06:50:37,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:50:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-07 06:50:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2020-11-07 06:50:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-07 06:50:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2020-11-07 06:50:37,157 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 65 [2020-11-07 06:50:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:37,157 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2020-11-07 06:50:37,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:50:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2020-11-07 06:50:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 06:50:37,158 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:37,159 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:50:37,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 06:50:37,159 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:37,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1939332709, now seen corresponding path program 1 times [2020-11-07 06:50:37,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:37,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [662190094] [2020-11-07 06:50:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:37,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:37,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:37,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:50:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:37,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [662190094] [2020-11-07 06:50:37,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:37,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:50:37,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022931823] [2020-11-07 06:50:37,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:50:37,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:37,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:50:37,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:50:37,427 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 6 states. [2020-11-07 06:50:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:38,211 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2020-11-07 06:50:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:50:38,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-11-07 06:50:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:38,213 INFO L225 Difference]: With dead ends: 121 [2020-11-07 06:50:38,214 INFO L226 Difference]: Without dead ends: 94 [2020-11-07 06:50:38,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:50:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-07 06:50:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2020-11-07 06:50:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-07 06:50:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2020-11-07 06:50:38,256 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 66 [2020-11-07 06:50:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:38,256 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2020-11-07 06:50:38,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:50:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-11-07 06:50:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 06:50:38,257 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:38,257 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2020-11-07 06:50:38,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 06:50:38,258 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash 221811922, now seen corresponding path program 1 times [2020-11-07 06:50:38,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:38,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1944895398] [2020-11-07 06:50:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:38,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:38,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:38,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:50:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:38,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1944895398] [2020-11-07 06:50:38,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:38,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:50:38,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165544776] [2020-11-07 06:50:38,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:50:38,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:50:38,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:50:38,441 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 6 states. [2020-11-07 06:50:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:39,057 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2020-11-07 06:50:39,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:50:39,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2020-11-07 06:50:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:39,059 INFO L225 Difference]: With dead ends: 120 [2020-11-07 06:50:39,059 INFO L226 Difference]: Without dead ends: 93 [2020-11-07 06:50:39,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:50:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-07 06:50:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-11-07 06:50:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 06:50:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2020-11-07 06:50:39,112 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 67 [2020-11-07 06:50:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:39,112 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2020-11-07 06:50:39,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:50:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-11-07 06:50:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 06:50:39,113 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:39,113 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:50:39,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 06:50:39,113 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:39,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash -472126463, now seen corresponding path program 1 times [2020-11-07 06:50:39,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:39,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410611994] [2020-11-07 06:50:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:39,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:39,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:50:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:39,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:50:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:39,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410611994] [2020-11-07 06:50:39,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:39,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:50:39,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371379113] [2020-11-07 06:50:39,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:50:39,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:39,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:50:39,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:39,812 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 11 states. [2020-11-07 06:50:40,322 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:51:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:17,989 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2020-11-07 06:51:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:51:17,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2020-11-07 06:51:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:17,991 INFO L225 Difference]: With dead ends: 119 [2020-11-07 06:51:17,992 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 06:51:17,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=68, Invalid=236, Unknown=2, NotChecked=0, Total=306 [2020-11-07 06:51:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 06:51:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2020-11-07 06:51:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-11-07 06:51:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2020-11-07 06:51:18,037 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 68 [2020-11-07 06:51:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:18,038 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2020-11-07 06:51:18,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:51:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2020-11-07 06:51:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-07 06:51:18,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:18,039 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-11-07 06:51:18,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 06:51:18,039 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:18,039 INFO L82 PathProgramCache]: Analyzing trace with hash 520674872, now seen corresponding path program 1 times [2020-11-07 06:51:18,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:18,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287964895] [2020-11-07 06:51:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:18,824 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2020-11-07 06:51:18,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:18,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:51:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:18,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:51:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:51:18,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287964895] [2020-11-07 06:51:18,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:18,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 06:51:18,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674907227] [2020-11-07 06:51:18,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 06:51:18,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:18,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 06:51:18,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2020-11-07 06:51:18,967 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 21 states. [2020-11-07 06:51:20,931 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-07 06:51:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:21,879 INFO L93 Difference]: Finished difference Result 155 states and 189 transitions. [2020-11-07 06:51:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 06:51:21,880 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2020-11-07 06:51:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:21,882 INFO L225 Difference]: With dead ends: 155 [2020-11-07 06:51:21,882 INFO L226 Difference]: Without dead ends: 152 [2020-11-07 06:51:21,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 06:51:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-07 06:51:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 108. [2020-11-07 06:51:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-07 06:51:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2020-11-07 06:51:21,966 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 69 [2020-11-07 06:51:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:21,966 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2020-11-07 06:51:21,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 06:51:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2020-11-07 06:51:21,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 06:51:21,969 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:21,969 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2020-11-07 06:51:21,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 06:51:21,970 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:21,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:21,971 INFO L82 PathProgramCache]: Analyzing trace with hash 232003341, now seen corresponding path program 2 times [2020-11-07 06:51:21,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:21,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1555751047] [2020-11-07 06:51:21,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:51:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:51:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:51:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:51:22,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1555751047] [2020-11-07 06:51:22,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:22,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:51:22,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079675804] [2020-11-07 06:51:22,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:51:22,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:22,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:51:22,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:51:22,625 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 11 states. [2020-11-07 06:51:23,087 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:51:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:24,266 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2020-11-07 06:51:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:51:24,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-11-07 06:51:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:24,269 INFO L225 Difference]: With dead ends: 161 [2020-11-07 06:51:24,269 INFO L226 Difference]: Without dead ends: 114 [2020-11-07 06:51:24,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:51:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-11-07 06:51:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2020-11-07 06:51:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-07 06:51:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2020-11-07 06:51:24,329 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 78 [2020-11-07 06:51:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:24,329 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2020-11-07 06:51:24,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:51:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2020-11-07 06:51:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 06:51:24,331 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:24,331 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2020-11-07 06:51:24,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 06:51:24,331 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:24,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1011499128, now seen corresponding path program 1 times [2020-11-07 06:51:24,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:24,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866191787] [2020-11-07 06:51:24,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:51:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:51:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:51:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:51:24,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866191787] [2020-11-07 06:51:24,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:24,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:51:24,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322213134] [2020-11-07 06:51:24,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:51:24,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:51:24,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:51:24,562 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 7 states. [2020-11-07 06:51:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:25,667 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2020-11-07 06:51:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:51:25,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2020-11-07 06:51:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:25,670 INFO L225 Difference]: With dead ends: 140 [2020-11-07 06:51:25,670 INFO L226 Difference]: Without dead ends: 113 [2020-11-07 06:51:25,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:51:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-11-07 06:51:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2020-11-07 06:51:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-07 06:51:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2020-11-07 06:51:25,759 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 79 [2020-11-07 06:51:25,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:25,760 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2020-11-07 06:51:25,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:51:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2020-11-07 06:51:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-07 06:51:25,761 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:25,762 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:51:25,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 06:51:25,762 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash 124684787, now seen corresponding path program 1 times [2020-11-07 06:51:25,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:25,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1308833223] [2020-11-07 06:51:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:26,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:26,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:51:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:26,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:51:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:26,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:51:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:51:26,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1308833223] [2020-11-07 06:51:26,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:26,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:51:26,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454021948] [2020-11-07 06:51:26,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:51:26,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:51:26,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:51:26,110 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 7 states. [2020-11-07 06:51:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:27,386 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2020-11-07 06:51:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:51:27,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2020-11-07 06:51:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:27,389 INFO L225 Difference]: With dead ends: 139 [2020-11-07 06:51:27,389 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 06:51:27,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:51:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 06:51:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2020-11-07 06:51:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-07 06:51:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2020-11-07 06:51:27,507 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 80 [2020-11-07 06:51:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:27,508 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2020-11-07 06:51:27,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:51:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2020-11-07 06:51:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 06:51:27,509 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:27,510 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:51:27,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 06:51:27,510 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2016702574, now seen corresponding path program 1 times [2020-11-07 06:51:27,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:27,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223756869] [2020-11-07 06:51:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:51:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:51:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:51:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:51:27,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223756869] [2020-11-07 06:51:27,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:27,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:51:27,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448669015] [2020-11-07 06:51:27,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:51:27,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:27,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:51:27,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:51:27,812 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 7 states. [2020-11-07 06:51:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:47,747 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2020-11-07 06:51:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:51:47,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2020-11-07 06:51:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:47,753 INFO L225 Difference]: With dead ends: 162 [2020-11-07 06:51:47,753 INFO L226 Difference]: Without dead ends: 135 [2020-11-07 06:51:47,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:51:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-07 06:51:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2020-11-07 06:51:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 06:51:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2020-11-07 06:51:47,837 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 81 [2020-11-07 06:51:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:47,838 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2020-11-07 06:51:47,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:51:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2020-11-07 06:51:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-07 06:51:47,839 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:47,839 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:51:47,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 06:51:47,840 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1569766617, now seen corresponding path program 1 times [2020-11-07 06:51:47,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:47,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1775886070] [2020-11-07 06:51:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:48,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:48,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:51:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:48,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:51:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:48,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:51:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:51:48,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1775886070] [2020-11-07 06:51:48,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:48,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:51:48,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163543834] [2020-11-07 06:51:48,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:51:48,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:48,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:51:48,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:51:48,235 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand 7 states. [2020-11-07 06:51:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:49,575 INFO L93 Difference]: Finished difference Result 201 states and 250 transitions. [2020-11-07 06:51:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:51:49,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2020-11-07 06:51:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:49,578 INFO L225 Difference]: With dead ends: 201 [2020-11-07 06:51:49,578 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 06:51:49,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:51:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 06:51:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2020-11-07 06:51:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 06:51:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2020-11-07 06:51:49,680 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 82 [2020-11-07 06:51:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:49,680 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2020-11-07 06:51:49,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:51:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2020-11-07 06:51:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-07 06:51:49,681 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:49,681 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2020-11-07 06:51:49,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 06:51:49,682 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:49,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1629708628, now seen corresponding path program 1 times [2020-11-07 06:51:49,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:49,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [9463264] [2020-11-07 06:51:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:49,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:49,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:51:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:49,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:51:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:49,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:51:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:51:49,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [9463264] [2020-11-07 06:51:49,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:49,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:51:49,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041652654] [2020-11-07 06:51:49,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:51:49,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:51:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:51:49,919 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand 7 states. [2020-11-07 06:51:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:50,906 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2020-11-07 06:51:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:51:50,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2020-11-07 06:51:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:50,910 INFO L225 Difference]: With dead ends: 197 [2020-11-07 06:51:50,910 INFO L226 Difference]: Without dead ends: 138 [2020-11-07 06:51:50,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:51:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-07 06:51:51,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-11-07 06:51:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-11-07 06:51:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2020-11-07 06:51:51,071 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 83 [2020-11-07 06:51:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:51,071 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2020-11-07 06:51:51,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:51:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2020-11-07 06:51:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-07 06:51:51,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:51,073 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:51:51,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 06:51:51,073 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash 222998463, now seen corresponding path program 1 times [2020-11-07 06:51:51,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:51,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [471587293] [2020-11-07 06:51:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:52,200 WARN L194 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2020-11-07 06:51:52,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:52,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:51:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:52,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:51:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:52,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:51:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:51:52,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [471587293] [2020-11-07 06:51:52,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:52,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 06:51:52,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762185269] [2020-11-07 06:51:52,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 06:51:52,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:52,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 06:51:52,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2020-11-07 06:51:52,412 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand 23 states. [2020-11-07 06:51:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:57,294 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2020-11-07 06:51:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 06:51:57,295 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2020-11-07 06:51:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:57,296 INFO L225 Difference]: With dead ends: 159 [2020-11-07 06:51:57,296 INFO L226 Difference]: Without dead ends: 156 [2020-11-07 06:51:57,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=361, Invalid=1531, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 06:51:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-11-07 06:51:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2020-11-07 06:51:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-11-07 06:51:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2020-11-07 06:51:57,392 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 84 [2020-11-07 06:51:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:57,392 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2020-11-07 06:51:57,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 06:51:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2020-11-07 06:51:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-07 06:51:57,393 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:57,394 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:51:57,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 06:51:57,394 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:57,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1623723366, now seen corresponding path program 2 times [2020-11-07 06:51:57,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:57,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [359604157] [2020-11-07 06:51:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:58,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:58,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:51:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:58,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:51:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:58,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:51:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:58,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:51:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:51:58,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [359604157] [2020-11-07 06:51:58,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:58,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:51:58,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322198022] [2020-11-07 06:51:58,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:51:58,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:58,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:51:58,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:51:58,207 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand 12 states. [2020-11-07 06:51:58,680 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:51:58,838 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-11-07 06:52:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:00,134 INFO L93 Difference]: Finished difference Result 220 states and 273 transitions. [2020-11-07 06:52:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:52:00,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2020-11-07 06:52:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:00,136 INFO L225 Difference]: With dead ends: 220 [2020-11-07 06:52:00,136 INFO L226 Difference]: Without dead ends: 161 [2020-11-07 06:52:00,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:52:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-07 06:52:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2020-11-07 06:52:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-11-07 06:52:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2020-11-07 06:52:00,227 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2020-11-07 06:52:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:00,227 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2020-11-07 06:52:00,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:52:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2020-11-07 06:52:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-07 06:52:00,228 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:00,228 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:00,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 06:52:00,229 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:00,229 INFO L82 PathProgramCache]: Analyzing trace with hash -817851313, now seen corresponding path program 1 times [2020-11-07 06:52:00,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:00,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227003199] [2020-11-07 06:52:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:52:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:52:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:52:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:52:00,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227003199] [2020-11-07 06:52:00,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:52:00,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:52:00,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088803443] [2020-11-07 06:52:00,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:52:00,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:00,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:52:00,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:52:00,493 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 8 states. [2020-11-07 06:52:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:01,540 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2020-11-07 06:52:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:52:01,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2020-11-07 06:52:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:01,542 INFO L225 Difference]: With dead ends: 219 [2020-11-07 06:52:01,542 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 06:52:01,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:52:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 06:52:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2020-11-07 06:52:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-07 06:52:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2020-11-07 06:52:01,629 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 94 [2020-11-07 06:52:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:01,629 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2020-11-07 06:52:01,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:52:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2020-11-07 06:52:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-07 06:52:01,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:01,631 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:01,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-07 06:52:01,632 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:01,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1832799756, now seen corresponding path program 1 times [2020-11-07 06:52:01,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:01,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1243371564] [2020-11-07 06:52:01,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:01,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:02,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:52:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:02,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:52:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:02,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:52:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:02,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:52:02,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1243371564] [2020-11-07 06:52:02,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:52:02,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:52:02,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631934268] [2020-11-07 06:52:02,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:52:02,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:02,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:52:02,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:52:02,064 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand 8 states. [2020-11-07 06:52:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:03,238 INFO L93 Difference]: Finished difference Result 218 states and 269 transitions. [2020-11-07 06:52:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:52:03,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2020-11-07 06:52:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:03,242 INFO L225 Difference]: With dead ends: 218 [2020-11-07 06:52:03,242 INFO L226 Difference]: Without dead ends: 159 [2020-11-07 06:52:03,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:52:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-07 06:52:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2020-11-07 06:52:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-07 06:52:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2020-11-07 06:52:03,327 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 95 [2020-11-07 06:52:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:03,328 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2020-11-07 06:52:03,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:52:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2020-11-07 06:52:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 06:52:03,329 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:03,330 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:03,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-07 06:52:03,330 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash -866308235, now seen corresponding path program 1 times [2020-11-07 06:52:03,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:03,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1122453327] [2020-11-07 06:52:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:06,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:06,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:52:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:06,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:52:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:06,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:52:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:06,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 60 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:52:06,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1122453327] [2020-11-07 06:52:06,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:52:06,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:52:06,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582880203] [2020-11-07 06:52:06,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:52:06,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:06,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:52:06,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:52:06,288 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand 13 states. [2020-11-07 06:52:06,768 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:52:40,483 WARN L194 SmtUtils]: Spent 10.48 s on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2020-11-07 06:53:03,391 WARN L194 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-11-07 06:53:19,748 WARN L194 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-11-07 06:53:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:32,805 INFO L93 Difference]: Finished difference Result 211 states and 258 transitions. [2020-11-07 06:53:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 06:53:32,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-11-07 06:53:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:32,809 INFO L225 Difference]: With dead ends: 211 [2020-11-07 06:53:32,809 INFO L226 Difference]: Without dead ends: 152 [2020-11-07 06:53:32,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=129, Invalid=518, Unknown=3, NotChecked=0, Total=650 [2020-11-07 06:53:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-07 06:53:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2020-11-07 06:53:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-07 06:53:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2020-11-07 06:53:32,932 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 96 [2020-11-07 06:53:32,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:32,932 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2020-11-07 06:53:32,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:53:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2020-11-07 06:53:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 06:53:32,934 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:32,934 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:32,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-07 06:53:32,935 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:32,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:32,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1904222542, now seen corresponding path program 1 times [2020-11-07 06:53:32,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:32,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68221868] [2020-11-07 06:53:32,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:33,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:33,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:53:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:33,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:53:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:33,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:53:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:33,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:53:33,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68221868] [2020-11-07 06:53:33,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:33,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:53:33,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394958758] [2020-11-07 06:53:33,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:53:33,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:33,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:53:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:53:33,842 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand 12 states. [2020-11-07 06:53:34,380 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:53:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:36,096 INFO L93 Difference]: Finished difference Result 211 states and 259 transitions. [2020-11-07 06:53:36,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:53:36,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2020-11-07 06:53:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:36,099 INFO L225 Difference]: With dead ends: 211 [2020-11-07 06:53:36,100 INFO L226 Difference]: Without dead ends: 152 [2020-11-07 06:53:36,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:53:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-07 06:53:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2020-11-07 06:53:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-07 06:53:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2020-11-07 06:53:36,216 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 97 [2020-11-07 06:53:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:36,217 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2020-11-07 06:53:36,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:53:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2020-11-07 06:53:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-07 06:53:36,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:36,218 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:36,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-07 06:53:36,219 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:36,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:36,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1310227099, now seen corresponding path program 1 times [2020-11-07 06:53:36,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:36,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [50988569] [2020-11-07 06:53:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:37,227 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2020-11-07 06:53:37,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:37,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:53:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:37,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:53:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:37,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:53:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:37,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:53:37,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [50988569] [2020-11-07 06:53:37,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:37,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 06:53:37,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935633708] [2020-11-07 06:53:37,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 06:53:37,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 06:53:37,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:53:37,420 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand 25 states. [2020-11-07 06:53:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:40,447 INFO L93 Difference]: Finished difference Result 176 states and 205 transitions. [2020-11-07 06:53:40,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 06:53:40,448 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 98 [2020-11-07 06:53:40,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:40,450 INFO L225 Difference]: With dead ends: 176 [2020-11-07 06:53:40,450 INFO L226 Difference]: Without dead ends: 173 [2020-11-07 06:53:40,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=400, Invalid=1856, Unknown=0, NotChecked=0, Total=2256 [2020-11-07 06:53:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-07 06:53:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2020-11-07 06:53:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-07 06:53:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2020-11-07 06:53:40,546 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 98 [2020-11-07 06:53:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:40,546 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2020-11-07 06:53:40,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 06:53:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2020-11-07 06:53:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-07 06:53:40,548 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:40,548 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:40,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-07 06:53:40,548 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1728398838, now seen corresponding path program 2 times [2020-11-07 06:53:40,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:40,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [94561205] [2020-11-07 06:53:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:40,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:40,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:53:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:40,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:53:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:40,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:53:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:40,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:40,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:53:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 21 proven. 84 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:53:40,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [94561205] [2020-11-07 06:53:40,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:40,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:53:40,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405490366] [2020-11-07 06:53:40,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:53:40,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:40,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:53:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:53:40,951 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 9 states. [2020-11-07 06:53:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:42,604 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2020-11-07 06:53:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:53:42,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2020-11-07 06:53:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:42,607 INFO L225 Difference]: With dead ends: 233 [2020-11-07 06:53:42,607 INFO L226 Difference]: Without dead ends: 174 [2020-11-07 06:53:42,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:53:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-07 06:53:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 159. [2020-11-07 06:53:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-11-07 06:53:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2020-11-07 06:53:42,785 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 107 [2020-11-07 06:53:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:42,785 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2020-11-07 06:53:42,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:53:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2020-11-07 06:53:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 06:53:42,786 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:42,787 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:42,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-07 06:53:42,787 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:42,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:42,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1654424533, now seen corresponding path program 1 times [2020-11-07 06:53:42,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:42,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1147386146] [2020-11-07 06:53:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:43,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:43,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:53:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:43,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:53:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:43,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:53:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:43,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:43,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:53:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 20 proven. 88 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:53:43,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1147386146] [2020-11-07 06:53:43,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:43,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:53:43,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945283048] [2020-11-07 06:53:43,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:53:43,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:43,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:53:43,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:53:43,083 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand 9 states. [2020-11-07 06:53:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:44,521 INFO L93 Difference]: Finished difference Result 230 states and 281 transitions. [2020-11-07 06:53:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:53:44,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2020-11-07 06:53:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:44,524 INFO L225 Difference]: With dead ends: 230 [2020-11-07 06:53:44,524 INFO L226 Difference]: Without dead ends: 171 [2020-11-07 06:53:44,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:53:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-11-07 06:53:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2020-11-07 06:53:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 06:53:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 189 transitions. [2020-11-07 06:53:44,647 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 189 transitions. Word has length 108 [2020-11-07 06:53:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:44,647 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 189 transitions. [2020-11-07 06:53:44,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:53:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 189 transitions. [2020-11-07 06:53:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-07 06:53:44,648 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:44,648 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:44,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-07 06:53:44,649 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1668833712, now seen corresponding path program 1 times [2020-11-07 06:53:44,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:44,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [530419120] [2020-11-07 06:53:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:45,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:45,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:53:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:45,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:53:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:45,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:53:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:45,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:45,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:53:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 20 proven. 92 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:53:45,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [530419120] [2020-11-07 06:53:45,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:45,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:53:45,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063961618] [2020-11-07 06:53:45,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:53:45,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:45,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:53:45,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:53:45,099 INFO L87 Difference]: Start difference. First operand 164 states and 189 transitions. Second operand 9 states. [2020-11-07 06:53:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:46,579 INFO L93 Difference]: Finished difference Result 229 states and 278 transitions. [2020-11-07 06:53:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:53:46,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-11-07 06:53:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:46,581 INFO L225 Difference]: With dead ends: 229 [2020-11-07 06:53:46,581 INFO L226 Difference]: Without dead ends: 170 [2020-11-07 06:53:46,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:53:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-11-07 06:53:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2020-11-07 06:53:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 06:53:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 188 transitions. [2020-11-07 06:53:46,706 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 188 transitions. Word has length 109 [2020-11-07 06:53:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:46,706 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 188 transitions. [2020-11-07 06:53:46,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:53:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2020-11-07 06:53:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-07 06:53:46,707 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:46,707 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:46,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-07 06:53:46,708 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash -561800874, now seen corresponding path program 1 times [2020-11-07 06:53:46,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:46,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1457607101] [2020-11-07 06:53:46,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:47,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:47,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:53:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:47,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:53:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:47,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:53:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:47,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:47,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:53:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 10 proven. 110 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:53:47,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1457607101] [2020-11-07 06:53:47,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:47,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-07 06:53:47,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524523218] [2020-11-07 06:53:47,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 06:53:47,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:47,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 06:53:47,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-11-07 06:53:47,927 INFO L87 Difference]: Start difference. First operand 164 states and 188 transitions. Second operand 27 states. [2020-11-07 06:53:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:57,892 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2020-11-07 06:53:57,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 06:53:57,893 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 111 [2020-11-07 06:53:57,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:57,895 INFO L225 Difference]: With dead ends: 275 [2020-11-07 06:53:57,895 INFO L226 Difference]: Without dead ends: 272 [2020-11-07 06:53:57,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=445, Invalid=2207, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 06:53:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-11-07 06:53:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 219. [2020-11-07 06:53:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-11-07 06:53:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2020-11-07 06:53:58,064 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 111 [2020-11-07 06:53:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:58,064 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2020-11-07 06:53:58,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 06:53:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2020-11-07 06:53:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-11-07 06:53:58,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:58,065 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:58,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-07 06:53:58,065 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1574370735, now seen corresponding path program 2 times [2020-11-07 06:53:58,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:58,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [419207336] [2020-11-07 06:53:58,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:58,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:58,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:53:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:58,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:53:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:58,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:53:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:58,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:58,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:53:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:58,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:53:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 25 proven. 122 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:53:58,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [419207336] [2020-11-07 06:53:58,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:58,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:53:58,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142605715] [2020-11-07 06:53:58,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:53:58,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:58,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:53:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:53:58,449 INFO L87 Difference]: Start difference. First operand 219 states and 269 transitions. Second operand 10 states. [2020-11-07 06:54:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:00,061 INFO L93 Difference]: Finished difference Result 302 states and 382 transitions. [2020-11-07 06:54:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:54:00,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2020-11-07 06:54:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:00,064 INFO L225 Difference]: With dead ends: 302 [2020-11-07 06:54:00,064 INFO L226 Difference]: Without dead ends: 187 [2020-11-07 06:54:00,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:54:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-11-07 06:54:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2020-11-07 06:54:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-07 06:54:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 202 transitions. [2020-11-07 06:54:00,180 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 202 transitions. Word has length 120 [2020-11-07 06:54:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:00,180 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 202 transitions. [2020-11-07 06:54:00,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:54:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 202 transitions. [2020-11-07 06:54:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-07 06:54:00,181 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:00,181 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:54:00,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-07 06:54:00,182 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1947184422, now seen corresponding path program 1 times [2020-11-07 06:54:00,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:00,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1391369685] [2020-11-07 06:54:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:00,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:00,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:54:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:00,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:54:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:00,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:54:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:00,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:54:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:00,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:54:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:00,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:54:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 24 proven. 127 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:54:00,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1391369685] [2020-11-07 06:54:00,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:00,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:54:00,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071117484] [2020-11-07 06:54:00,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:54:00,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:54:00,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:54:00,466 INFO L87 Difference]: Start difference. First operand 176 states and 202 transitions. Second operand 10 states. [2020-11-07 06:54:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:01,898 INFO L93 Difference]: Finished difference Result 244 states and 295 transitions. [2020-11-07 06:54:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:54:01,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 121 [2020-11-07 06:54:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:01,900 INFO L225 Difference]: With dead ends: 244 [2020-11-07 06:54:01,900 INFO L226 Difference]: Without dead ends: 185 [2020-11-07 06:54:01,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:54:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-11-07 06:54:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2020-11-07 06:54:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-11-07 06:54:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 202 transitions. [2020-11-07 06:54:02,014 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 202 transitions. Word has length 121 [2020-11-07 06:54:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:02,014 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 202 transitions. [2020-11-07 06:54:02,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:54:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 202 transitions. [2020-11-07 06:54:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-11-07 06:54:02,015 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:02,015 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:54:02,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-07 06:54:02,015 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:02,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:02,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1649561621, now seen corresponding path program 1 times [2020-11-07 06:54:02,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:02,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2105749416] [2020-11-07 06:54:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:02,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:02,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:54:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:02,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:54:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:02,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:54:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:02,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:54:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:02,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:54:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:02,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:54:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 24 proven. 132 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:54:02,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2105749416] [2020-11-07 06:54:02,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:02,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:54:02,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834781079] [2020-11-07 06:54:02,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:54:02,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:02,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:54:02,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:54:02,385 INFO L87 Difference]: Start difference. First operand 177 states and 202 transitions. Second operand 10 states. [2020-11-07 06:54:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:03,886 INFO L93 Difference]: Finished difference Result 238 states and 286 transitions. [2020-11-07 06:54:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:54:03,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2020-11-07 06:54:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:03,890 INFO L225 Difference]: With dead ends: 238 [2020-11-07 06:54:03,890 INFO L226 Difference]: Without dead ends: 177 [2020-11-07 06:54:03,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:54:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-11-07 06:54:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2020-11-07 06:54:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-11-07 06:54:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2020-11-07 06:54:03,997 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 122 [2020-11-07 06:54:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:03,997 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2020-11-07 06:54:03,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:54:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2020-11-07 06:54:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-11-07 06:54:03,998 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:03,999 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:54:03,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-07 06:54:03,999 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2043244172, now seen corresponding path program 1 times [2020-11-07 06:54:04,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:04,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76074690] [2020-11-07 06:54:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:05,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:05,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:54:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:05,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:54:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:05,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:54:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:05,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:54:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:05,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:54:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:05,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:54:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 12 proven. 149 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:54:05,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76074690] [2020-11-07 06:54:05,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:05,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-11-07 06:54:05,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499155309] [2020-11-07 06:54:05,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-07 06:54:05,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:05,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-07 06:54:05,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2020-11-07 06:54:05,397 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 29 states. [2020-11-07 06:54:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:08,954 INFO L93 Difference]: Finished difference Result 201 states and 230 transitions. [2020-11-07 06:54:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 06:54:08,955 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 123 [2020-11-07 06:54:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:08,956 INFO L225 Difference]: With dead ends: 201 [2020-11-07 06:54:08,956 INFO L226 Difference]: Without dead ends: 198 [2020-11-07 06:54:08,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=496, Invalid=2584, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 06:54:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-07 06:54:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 182. [2020-11-07 06:54:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-11-07 06:54:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 205 transitions. [2020-11-07 06:54:09,080 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 205 transitions. Word has length 123 [2020-11-07 06:54:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:09,081 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 205 transitions. [2020-11-07 06:54:09,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-07 06:54:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 205 transitions. [2020-11-07 06:54:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 06:54:09,082 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:09,082 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:54:09,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-07 06:54:09,082 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:09,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1120838969, now seen corresponding path program 2 times [2020-11-07 06:54:09,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:09,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1271966106] [2020-11-07 06:54:09,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:54:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:54:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:54:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:54:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:54:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:54:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:54:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 29 proven. 163 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-07 06:54:09,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1271966106] [2020-11-07 06:54:09,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:09,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:54:09,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992522038] [2020-11-07 06:54:09,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:54:09,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:09,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:54:09,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:54:09,594 INFO L87 Difference]: Start difference. First operand 182 states and 205 transitions. Second operand 11 states. [2020-11-07 06:54:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:11,295 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2020-11-07 06:54:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:54:11,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2020-11-07 06:54:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:11,297 INFO L225 Difference]: With dead ends: 256 [2020-11-07 06:54:11,297 INFO L226 Difference]: Without dead ends: 197 [2020-11-07 06:54:11,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:54:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-11-07 06:54:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2020-11-07 06:54:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-11-07 06:54:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2020-11-07 06:54:11,411 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 132 [2020-11-07 06:54:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:11,411 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2020-11-07 06:54:11,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:54:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2020-11-07 06:54:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-07 06:54:11,412 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:11,413 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:54:11,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-07 06:54:11,413 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:11,413 INFO L82 PathProgramCache]: Analyzing trace with hash 772601564, now seen corresponding path program 1 times [2020-11-07 06:54:11,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:11,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [54669928] [2020-11-07 06:54:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:11,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:11,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:54:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:11,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:54:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:11,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:54:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:11,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:54:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:11,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:54:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:11,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:54:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:11,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:54:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 28 proven. 169 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-07 06:54:11,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [54669928] [2020-11-07 06:54:11,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:11,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:54:11,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704067997] [2020-11-07 06:54:11,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:54:11,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:11,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:54:11,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:54:11,802 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand 11 states. [2020-11-07 06:54:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:13,456 INFO L93 Difference]: Finished difference Result 251 states and 300 transitions. [2020-11-07 06:54:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:54:13,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 133 [2020-11-07 06:54:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:13,458 INFO L225 Difference]: With dead ends: 251 [2020-11-07 06:54:13,459 INFO L226 Difference]: Without dead ends: 188 [2020-11-07 06:54:13,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:54:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-07 06:54:13,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2020-11-07 06:54:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-07 06:54:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2020-11-07 06:54:13,629 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 209 transitions. Word has length 133 [2020-11-07 06:54:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:13,630 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 209 transitions. [2020-11-07 06:54:13,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:54:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 209 transitions. [2020-11-07 06:54:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-07 06:54:13,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:13,631 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:54:13,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-07 06:54:13,632 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:13,632 INFO L82 PathProgramCache]: Analyzing trace with hash -402768609, now seen corresponding path program 1 times [2020-11-07 06:54:13,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:13,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408717549] [2020-11-07 06:54:13,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:14,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:14,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:54:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:14,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:54:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:14,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:54:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:14,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:54:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:14,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:54:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:14,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:54:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:14,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:54:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 14 proven. 189 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-07 06:54:15,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408717549] [2020-11-07 06:54:15,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:15,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-11-07 06:54:15,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873291870] [2020-11-07 06:54:15,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-11-07 06:54:15,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-11-07 06:54:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2020-11-07 06:54:15,094 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. Second operand 31 states. [2020-11-07 06:54:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:24,759 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2020-11-07 06:54:24,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-07 06:54:24,760 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 134 [2020-11-07 06:54:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:24,761 INFO L225 Difference]: With dead ends: 213 [2020-11-07 06:54:24,761 INFO L226 Difference]: Without dead ends: 210 [2020-11-07 06:54:24,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=553, Invalid=2987, Unknown=0, NotChecked=0, Total=3540 [2020-11-07 06:54:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-11-07 06:54:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 193. [2020-11-07 06:54:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-11-07 06:54:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2020-11-07 06:54:24,885 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 134 [2020-11-07 06:54:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:24,885 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2020-11-07 06:54:24,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-11-07 06:54:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2020-11-07 06:54:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-11-07 06:54:24,887 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:24,887 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:54:24,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-07 06:54:24,887 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash -296907770, now seen corresponding path program 2 times [2020-11-07 06:54:24,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:24,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [727956589] [2020-11-07 06:54:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:54:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:54:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:54:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:54:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:54:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:54:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:54:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-11-07 06:54:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 33 proven. 205 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-11-07 06:54:25,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [727956589] [2020-11-07 06:54:25,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:25,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:54:25,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811196041] [2020-11-07 06:54:25,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:54:25,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:25,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:54:25,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:54:25,549 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand 12 states. [2020-11-07 06:54:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:27,769 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2020-11-07 06:54:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:54:27,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-11-07 06:54:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:27,772 INFO L225 Difference]: With dead ends: 257 [2020-11-07 06:54:27,772 INFO L226 Difference]: Without dead ends: 198 [2020-11-07 06:54:27,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-07 06:54:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-07 06:54:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2020-11-07 06:54:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-11-07 06:54:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 219 transitions. [2020-11-07 06:54:27,951 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 219 transitions. Word has length 143 [2020-11-07 06:54:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:27,952 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 219 transitions. [2020-11-07 06:54:27,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:54:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 219 transitions. [2020-11-07 06:54:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 06:54:27,953 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:27,953 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:54:27,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-07 06:54:27,953 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash -227874385, now seen corresponding path program 1 times [2020-11-07 06:54:27,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:27,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849938928] [2020-11-07 06:54:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:54:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:54:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:54:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:54:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:54:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:54:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:54:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-11-07 06:54:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 16 proven. 228 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-11-07 06:54:29,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849938928] [2020-11-07 06:54:29,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:29,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2020-11-07 06:54:29,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165599137] [2020-11-07 06:54:29,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-11-07 06:54:29,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:29,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-11-07 06:54:29,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 06:54:29,620 INFO L87 Difference]: Start difference. First operand 196 states and 219 transitions. Second operand 33 states. [2020-11-07 06:54:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:33,438 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2020-11-07 06:54:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-07 06:54:33,440 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 144 [2020-11-07 06:54:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:33,441 INFO L225 Difference]: With dead ends: 222 [2020-11-07 06:54:33,441 INFO L226 Difference]: Without dead ends: 219 [2020-11-07 06:54:33,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=616, Invalid=3416, Unknown=0, NotChecked=0, Total=4032 [2020-11-07 06:54:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-11-07 06:54:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2020-11-07 06:54:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-11-07 06:54:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 226 transitions. [2020-11-07 06:54:33,566 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 226 transitions. Word has length 144 [2020-11-07 06:54:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:33,566 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 226 transitions. [2020-11-07 06:54:33,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-11-07 06:54:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 226 transitions. [2020-11-07 06:54:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 06:54:33,567 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:33,568 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 8, 7, 6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:54:33,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-07 06:54:33,568 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1632501386, now seen corresponding path program 2 times [2020-11-07 06:54:33,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:33,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2058722845] [2020-11-07 06:54:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 06:54:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:54:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:54:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:54:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-07 06:54:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:54:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:54:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-11-07 06:54:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 06:54:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-11-07 06:54:35,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2058722845] [2020-11-07 06:54:35,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:35,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2020-11-07 06:54:35,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826246394] [2020-11-07 06:54:35,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-11-07 06:54:35,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:35,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-07 06:54:35,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 06:54:35,212 INFO L87 Difference]: Start difference. First operand 203 states and 226 transitions. Second operand 34 states. [2020-11-07 06:54:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:39,339 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2020-11-07 06:54:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-07 06:54:39,340 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 153 [2020-11-07 06:54:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:39,340 INFO L225 Difference]: With dead ends: 203 [2020-11-07 06:54:39,340 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:54:39,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=633, Invalid=3399, Unknown=0, NotChecked=0, Total=4032 [2020-11-07 06:54:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:54:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:54:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:54:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:54:39,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2020-11-07 06:54:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:39,343 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:54:39,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-11-07 06:54:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:54:39,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:54:39,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-07 06:54:39,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:54:39,822 WARN L194 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 422 DAG size of output: 364 [2020-11-07 06:54:40,686 WARN L194 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 368 DAG size of output: 225 [2020-11-07 06:54:41,342 WARN L194 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 432 DAG size of output: 371 [2020-11-07 06:54:42,180 WARN L194 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 305 [2020-11-07 06:54:42,819 WARN L194 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 340 [2020-11-07 06:54:43,730 WARN L194 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 512 DAG size of output: 373 [2020-11-07 06:54:43,937 WARN L194 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 148 [2020-11-07 06:54:44,654 WARN L194 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 430 DAG size of output: 367 [2020-11-07 06:54:44,899 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 133 [2020-11-07 06:54:45,083 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 412 DAG size of output: 380 [2020-11-07 06:54:45,504 WARN L194 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 179 [2020-11-07 06:54:45,758 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 374 [2020-11-07 06:54:46,160 WARN L194 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 281 [2020-11-07 06:54:46,311 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 383 [2020-11-07 06:54:46,611 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 434 DAG size of output: 320 [2020-11-07 06:54:47,240 WARN L194 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 439 DAG size of output: 348 [2020-11-07 06:54:47,522 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 159 [2020-11-07 06:54:47,918 WARN L194 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 192 [2020-11-07 06:54:48,059 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2020-11-07 06:54:48,164 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-11-07 06:54:48,712 WARN L194 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 343 DAG size of output: 21 [2020-11-07 06:54:57,573 WARN L194 SmtUtils]: Spent 8.86 s on a formula simplification. DAG size of input: 208 DAG size of output: 39 [2020-11-07 06:54:57,677 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2020-11-07 06:54:57,800 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2020-11-07 06:54:59,071 WARN L194 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 355 DAG size of output: 21 [2020-11-07 06:55:00,862 WARN L194 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 291 DAG size of output: 59 [2020-11-07 06:55:04,595 WARN L194 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 324 DAG size of output: 50 [2020-11-07 06:55:05,922 WARN L194 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 353 DAG size of output: 23 [2020-11-07 06:55:06,255 WARN L194 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 21 [2020-11-07 06:55:19,891 WARN L194 SmtUtils]: Spent 13.63 s on a formula simplification. DAG size of input: 348 DAG size of output: 51 [2020-11-07 06:55:20,028 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-11-07 06:55:20,156 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-11-07 06:55:20,296 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-11-07 06:55:20,565 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 21 [2020-11-07 06:55:21,287 WARN L194 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 21 [2020-11-07 06:55:28,959 WARN L194 SmtUtils]: Spent 7.61 s on a formula simplification. DAG size of input: 166 DAG size of output: 39 [2020-11-07 06:55:29,831 WARN L194 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 359 DAG size of output: 21 [2020-11-07 06:55:44,603 WARN L194 SmtUtils]: Spent 14.76 s on a formula simplification. DAG size of input: 266 DAG size of output: 59 [2020-11-07 06:55:44,717 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-11-07 06:55:45,373 WARN L194 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 21 [2020-11-07 06:55:45,517 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-11-07 06:55:46,211 WARN L194 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 39 [2020-11-07 06:55:46,634 WARN L194 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 348 DAG size of output: 21 [2020-11-07 06:55:46,818 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 21 [2020-11-07 06:55:54,307 WARN L194 SmtUtils]: Spent 7.49 s on a formula simplification. DAG size of input: 331 DAG size of output: 50 [2020-11-07 06:55:55,161 WARN L194 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 21 [2020-11-07 06:55:56,119 WARN L194 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 39 [2020-11-07 06:55:56,124 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,124 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,124 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,124 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,124 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,125 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,125 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:55:56,125 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,125 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:55:56,125 INFO L269 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,125 INFO L262 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:55:56,125 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~SIZE~0 |old(~SIZE~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 06:55:56,126 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,126 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 06:55:56,126 INFO L262 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:55:56,126 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:55:56,126 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:55:56,126 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:55:56,126 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:55:56,126 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:55:56,127 INFO L266 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-11-07 06:55:56,127 INFO L266 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-11-07 06:55:56,127 INFO L266 CegarLoopResult]: For program point L6-3(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:55:56,127 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:55:56,127 INFO L262 CegarLoopResult]: At program point L31(lines 31 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse1 (- 6)) .cse2) 4294967296)) (* 6 .cse1) (* 4294967296 .cse3) 1)))) main_~l~0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,127 INFO L262 CegarLoopResult]: At program point L27(lines 27 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,127 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 16 45) the Hoare annotation is: true [2020-11-07 06:55:56,127 INFO L262 CegarLoopResult]: At program point L23(lines 23 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,127 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,127 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,128 INFO L262 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,128 INFO L262 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (or (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 1)) 2)) 1)) (<= (let ((.cse1 (div .cse4 3))) (+ (* 3 .cse1) (* 4294967298 (div (+ (* .cse1 (- 3)) main_~l~0 .cse2) 4294967296)) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= .cse0 main_~l~0))))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,128 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse1 (- 5)) .cse2) 4294967296)) (* 5 .cse1) (* 4294967296 .cse3) 1)))) main_~l~0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,128 INFO L262 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse1 (- 6)) .cse2) 4294967296)) (* 6 .cse1) (* 4294967296 .cse3) 1)))) main_~l~0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,128 INFO L262 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,128 INFO L262 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,129 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,129 INFO L262 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0) (= main_~v6~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,129 INFO L262 CegarLoopResult]: At program point L37(lines 37 40) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse1 (div .cse4 3))) (+ (* 3 .cse1) (* 4294967298 (div (+ (* .cse1 (- 3)) main_~l~0 .cse2) 4294967296)) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= .cse0 main_~l~0)))))) [2020-11-07 06:55:56,129 INFO L262 CegarLoopResult]: At program point L37-2(lines 23 40) the Hoare annotation is: (or (let ((.cse1 (+ main_~l~0 1)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,129 INFO L262 CegarLoopResult]: At program point L33(lines 33 40) the Hoare annotation is: (or (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse1 (div .cse4 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse1 (- 6)) .cse2) 4294967296)) (* 6 .cse1) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= .cse0 main_~l~0))))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,129 INFO L262 CegarLoopResult]: At program point L29(lines 29 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,130 INFO L262 CegarLoopResult]: At program point L25(lines 25 40) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,130 INFO L269 CegarLoopResult]: At program point L21-2(lines 21 43) the Hoare annotation is: true [2020-11-07 06:55:56,130 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 06:55:56,130 INFO L262 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (or (= main_~i~0 0) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,130 INFO L262 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,130 INFO L262 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,130 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 16 45) the Hoare annotation is: true [2020-11-07 06:55:56,130 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,130 INFO L262 CegarLoopResult]: At program point L42-1(lines 21 43) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,131 INFO L262 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (or (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse1 (div .cse4 3))) (+ (* 3 .cse1) (* 4294967298 (div (+ (* .cse1 (- 3)) main_~l~0 .cse2) 4294967296)) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= .cse0 main_~l~0))))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,131 INFO L262 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse1 (- 5)) .cse2) 4294967296)) (* 5 .cse1) (* 4294967296 .cse3) 1)))) main_~l~0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,131 INFO L262 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,131 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 16 45) the Hoare annotation is: true [2020-11-07 06:55:56,131 INFO L262 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,131 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,131 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,131 INFO L262 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,132 INFO L262 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,132 INFO L262 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,132 INFO L262 CegarLoopResult]: At program point L18-5(line 18) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,132 INFO L262 CegarLoopResult]: At program point L35(lines 35 40) the Hoare annotation is: (or (let ((.cse6 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse6 (- 4294967296)))) (let ((.cse3 (* 4294967296 .cse6)) (.cse4 (+ main_~l~0 .cse2)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0 main_~v6~0))) (and (<= main_~l~0 .cse0) (<= (let ((.cse1 (div .cse4 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse1 (- 6)) .cse2) 4294967296)) (* 6 .cse1) .cse3 1)) main_~l~0) (<= (let ((.cse5 (div .cse4 5))) (+ (* 4294967295 (div (+ main_~l~0 (* .cse5 (- 5)) .cse2) 4294967296)) (* 5 .cse5) .cse3 1)) main_~l~0) (<= .cse0 main_~l~0))))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,132 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2020-11-07 06:55:56,132 INFO L262 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-11-07 06:55:56,132 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,132 INFO L262 CegarLoopResult]: At program point L9(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,132 INFO L262 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-11-07 06:55:56,133 INFO L262 CegarLoopResult]: At program point L9-2(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:55:56,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:55:56 BoogieIcfgContainer [2020-11-07 06:55:56,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:55:56,167 INFO L168 Benchmark]: Toolchain (without parser) took 378027.16 ms. Allocated memory was 158.3 MB in the beginning and 398.5 MB in the end (delta: 240.1 MB). Free memory was 134.8 MB in the beginning and 306.6 MB in the end (delta: -171.8 MB). Peak memory consumption was 240.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:56,167 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 158.3 MB. Free memory was 132.7 MB in the beginning and 132.6 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:55:56,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.71 ms. Allocated memory is still 158.3 MB. Free memory was 134.3 MB in the beginning and 124.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:56,168 INFO L168 Benchmark]: Boogie Preprocessor took 51.03 ms. Allocated memory is still 158.3 MB. Free memory was 124.2 MB in the beginning and 122.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:56,169 INFO L168 Benchmark]: RCFGBuilder took 926.02 ms. Allocated memory is still 158.3 MB. Free memory was 122.7 MB in the beginning and 135.1 MB in the end (delta: -12.4 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:56,169 INFO L168 Benchmark]: TraceAbstraction took 376712.52 ms. Allocated memory was 158.3 MB in the beginning and 398.5 MB in the end (delta: 240.1 MB). Free memory was 135.1 MB in the beginning and 306.6 MB in the end (delta: -171.5 MB). Peak memory consumption was 239.7 MB. Max. memory is 8.0 GB. [2020-11-07 06:55:56,171 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.34 ms. Allocated memory is still 158.3 MB. Free memory was 132.7 MB in the beginning and 132.6 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 314.71 ms. Allocated memory is still 158.3 MB. Free memory was 134.3 MB in the beginning and 124.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 51.03 ms. Allocated memory is still 158.3 MB. Free memory was 124.2 MB in the beginning and 122.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 926.02 ms. Allocated memory is still 158.3 MB. Free memory was 122.7 MB in the beginning and 135.1 MB in the end (delta: -12.4 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 376712.52 ms. Allocated memory was 158.3 MB in the beginning and 398.5 MB in the end (delta: 240.1 MB). Free memory was 135.1 MB in the beginning and 306.6 MB in the end (delta: -171.5 MB). Peak memory consumption was 239.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 21]: Loop Invariant Derived loop invariant: ((l <= i + j + k + v1 + v2 + v3 + v4 + v5 + v6 && i + j + k + v1 + v2 + v3 + v4 + v5 + v6 <= l) || !(SIZE <= 20000001)) || !(20000001 <= SIZE) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: ((\old(cond) == 0 || !(SIZE <= 20000001)) || !(cond == 0)) || !(20000001 <= SIZE) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 299.7s, OverallIterations: 45, TraceHistogramMax: 10, AutomataDifference: 263.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 76.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2029 SDtfs, 8618 SDslu, 4347 SDs, 0 SdLazy, 18922 SolverSat, 1570 SolverUnsat, 67 SolverUnknown, 0 SolverNotchecked, 173.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1421 GetRequests, 465 SyntacticMatches, 23 SemanticMatches, 933 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7601 ImplicationChecksByTransitivity, 92.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 45 MinimizatonAttempts, 701 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 64 LocationsWithAnnotation, 762 PreInvPairs, 937 NumberOfFragments, 1866 HoareAnnotationTreeSize, 762 FomulaSimplifications, 18737916237437 FormulaSimplificationTreeSizeReduction, 8.5s HoareSimplificationTime, 64 FomulaSimplificationsInter, 5147397914 FormulaSimplificationTreeSizeReductionInter, 68.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 3910 NumberOfCodeBlocks, 3910 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3865 ConstructedInterpolants, 0 QuantifiedInterpolants, 4189380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 1 PerfectInterpolantSequences, 1839/4659 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...