/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/recursive-simple/id_i25_o25-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:07:33,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:07:33,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:07:33,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:07:33,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:07:33,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:07:33,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:07:33,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:07:33,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:07:33,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:07:33,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:07:33,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:07:33,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:07:33,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:07:33,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:07:33,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:07:33,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:07:33,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:07:33,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:07:33,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:07:33,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:07:33,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:07:33,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:07:33,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:07:33,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:07:33,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:07:33,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:07:33,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:07:33,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:07:33,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:07:33,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:07:33,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:07:33,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:07:33,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:07:33,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:07:33,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:07:33,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:07:33,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:07:33,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:07:33,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:07:33,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:07:33,846 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 05:07:33,873 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:07:33,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:07:33,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:07:33,880 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:07:33,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:07:33,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:07:33,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:07:33,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:07:33,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:07:33,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:07:33,882 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:07:33,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:07:33,883 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:07:33,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:07:33,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:07:33,884 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:07:33,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:07:33,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:07:33,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:33,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:07:33,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:07:33,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:07:33,886 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 05:07:34,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:07:34,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:07:34,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:07:34,389 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:07:34,390 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:07:34,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-11-07 05:07:34,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b876df22e/3309e310bc1d4161845655d70cc4c616/FLAG90f5befa4 [2020-11-07 05:07:35,154 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:07:35,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-11-07 05:07:35,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b876df22e/3309e310bc1d4161845655d70cc4c616/FLAG90f5befa4 [2020-11-07 05:07:35,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b876df22e/3309e310bc1d4161845655d70cc4c616 [2020-11-07 05:07:35,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:07:35,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:07:35,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:35,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:07:35,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:07:35,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:35" (1/1) ... [2020-11-07 05:07:35,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36079efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35, skipping insertion in model container [2020-11-07 05:07:35,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:35" (1/1) ... [2020-11-07 05:07:35,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:07:35,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:07:35,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:35,739 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:07:35,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:35,773 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:07:35,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35 WrapperNode [2020-11-07 05:07:35,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:35,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:07:35,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:07:35,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:07:35,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35" (1/1) ... [2020-11-07 05:07:35,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35" (1/1) ... [2020-11-07 05:07:35,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35" (1/1) ... [2020-11-07 05:07:35,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35" (1/1) ... [2020-11-07 05:07:35,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35" (1/1) ... [2020-11-07 05:07:35,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35" (1/1) ... [2020-11-07 05:07:35,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35" (1/1) ... [2020-11-07 05:07:35,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:07:35,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:07:35,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:07:35,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:07:35,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35" (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 05:07:35,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:07:35,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:07:35,910 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:07:35,910 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 05:07:35,910 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:07:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:07:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:07:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:07:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:07:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:07:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 05:07:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:07:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:07:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:07:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:07:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:07:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:07:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:07:36,457 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:07:36,459 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:07:36,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:36 BoogieIcfgContainer [2020-11-07 05:07:36,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:07:36,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:07:36,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:07:36,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:07:36,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:07:35" (1/3) ... [2020-11-07 05:07:36,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc6570c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:36, skipping insertion in model container [2020-11-07 05:07:36,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:35" (2/3) ... [2020-11-07 05:07:36,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc6570c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:36, skipping insertion in model container [2020-11-07 05:07:36,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:36" (3/3) ... [2020-11-07 05:07:36,478 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-1.c [2020-11-07 05:07:36,496 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:07:36,499 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:07:36,513 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:07:36,555 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:07:36,556 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:07:36,556 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:07:36,556 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:07:36,556 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:07:36,557 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:07:36,557 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:07:36,557 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:07:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 05:07:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:07:36,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:36,593 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] [2020-11-07 05:07:36,594 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 05:07:36,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:36,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [554718210] [2020-11-07 05:07:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,068 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 05:07:37,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [554718210] [2020-11-07 05:07:37,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:07:37,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:07:37,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542220730] [2020-11-07 05:07:37,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:07:37,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:37,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:07:37,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:07:37,095 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 05:07:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:37,410 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-11-07 05:07:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:07:37,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:07:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:37,423 INFO L225 Difference]: With dead ends: 50 [2020-11-07 05:07:37,423 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 05:07:37,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:07:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 05:07:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 05:07:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 05:07:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 05:07:37,560 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 05:07:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:37,561 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 05:07:37,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:07:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 05:07:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 05:07:37,563 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:37,564 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:07:37,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:07:37,564 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:37,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 05:07:37,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:37,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [118733126] [2020-11-07 05:07:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:07:37,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [118733126] [2020-11-07 05:07:37,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:37,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:07:37,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37081231] [2020-11-07 05:07:37,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:07:37,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:07:37,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:07:37,769 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 05:07:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:38,034 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 05:07:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:38,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 05:07:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:38,037 INFO L225 Difference]: With dead ends: 44 [2020-11-07 05:07:38,037 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:07:38,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:07:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:07:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:07:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 05:07:38,054 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 05:07:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:38,055 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 05:07:38,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:07:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 05:07:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 05:07:38,057 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:38,057 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:07:38,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:07:38,058 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 05:07:38,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:38,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1873236178] [2020-11-07 05:07:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 05:07:38,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1873236178] [2020-11-07 05:07:38,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:38,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:07:38,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949208709] [2020-11-07 05:07:38,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:07:38,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:07:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:07:38,244 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 05:07:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:38,530 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 05:07:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:07:38,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 05:07:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:38,533 INFO L225 Difference]: With dead ends: 49 [2020-11-07 05:07:38,533 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 05:07:38,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 05:07:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 05:07:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 05:07:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 05:07:38,549 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 05:07:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:38,549 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 05:07:38,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:07:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 05:07:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 05:07:38,552 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:38,552 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:38,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:07:38,552 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 05:07:38,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:38,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [822408895] [2020-11-07 05:07:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 05:07:38,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [822408895] [2020-11-07 05:07:38,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:38,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:07:38,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741283000] [2020-11-07 05:07:38,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:07:38,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:38,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:07:38,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:07:38,749 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 05:07:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:39,096 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 05:07:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:07:39,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 05:07:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:39,098 INFO L225 Difference]: With dead ends: 54 [2020-11-07 05:07:39,098 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 05:07:39,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 05:07:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 05:07:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 05:07:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 05:07:39,117 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 05:07:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:39,118 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 05:07:39,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:07:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 05:07:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 05:07:39,120 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:39,121 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:39,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:07:39,121 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:39,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 05:07:39,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:39,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [398288200] [2020-11-07 05:07:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:07:39,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [398288200] [2020-11-07 05:07:39,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:39,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:07:39,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610345352] [2020-11-07 05:07:39,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:07:39,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:39,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:07:39,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:39,340 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 05:07:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:39,778 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 05:07:39,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:07:39,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 05:07:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:39,783 INFO L225 Difference]: With dead ends: 59 [2020-11-07 05:07:39,783 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 05:07:39,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 05:07:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 05:07:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 05:07:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 05:07:39,799 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 05:07:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:39,799 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 05:07:39,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:07:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 05:07:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 05:07:39,801 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:39,801 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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 05:07:39,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:07:39,802 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:39,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 05:07:39,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:39,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1410241510] [2020-11-07 05:07:39,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 05:07:40,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1410241510] [2020-11-07 05:07:40,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:40,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:07:40,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600855674] [2020-11-07 05:07:40,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:07:40,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:40,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:07:40,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:40,078 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 05:07:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:40,575 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 05:07:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:07:40,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 05:07:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:40,581 INFO L225 Difference]: With dead ends: 64 [2020-11-07 05:07:40,581 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 05:07:40,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 05:07:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 05:07:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 05:07:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 05:07:40,599 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 05:07:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:40,600 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 05:07:40,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:07:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 05:07:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:07:40,602 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:40,602 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:40,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:07:40,602 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:40,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:40,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 05:07:40,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:40,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661747585] [2020-11-07 05:07:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 05:07:40,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661747585] [2020-11-07 05:07:40,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:40,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:07:40,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956331075] [2020-11-07 05:07:40,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:07:40,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:07:40,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:07:40,995 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 05:07:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:41,567 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 05:07:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:07:41,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 05:07:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:41,571 INFO L225 Difference]: With dead ends: 69 [2020-11-07 05:07:41,571 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 05:07:41,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 05:07:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 05:07:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 05:07:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 05:07:41,605 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 05:07:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:41,606 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 05:07:41,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:07:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 05:07:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 05:07:41,611 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:41,611 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:41,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:07:41,617 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:41,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:41,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 05:07:41,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:41,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404641272] [2020-11-07 05:07:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 05:07:41,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404641272] [2020-11-07 05:07:41,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:41,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:07:41,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431191228] [2020-11-07 05:07:41,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:07:41,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:07:41,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:41,939 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 05:07:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:42,513 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 05:07:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:07:42,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 05:07:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:42,516 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:07:42,516 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 05:07:42,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:07:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 05:07:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 05:07:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 05:07:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 05:07:42,537 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 05:07:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:42,538 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 05:07:42,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:07:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 05:07:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 05:07:42,544 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:42,544 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:42,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:07:42,546 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 05:07:42,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:42,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [251572584] [2020-11-07 05:07:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 05:07:42,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [251572584] [2020-11-07 05:07:42,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:42,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:07:42,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74454710] [2020-11-07 05:07:42,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:07:42,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:42,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:07:42,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:07:42,970 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 05:07:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:43,601 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 05:07:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:07:43,602 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 05:07:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:43,605 INFO L225 Difference]: With dead ends: 79 [2020-11-07 05:07:43,606 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 05:07:43,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:07:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 05:07:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 05:07:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 05:07:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 05:07:43,661 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 05:07:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:43,662 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 05:07:43,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:07:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 05:07:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:07:43,667 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:43,668 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:43,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:07:43,668 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 05:07:43,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:43,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [174830585] [2020-11-07 05:07:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 05:07:44,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [174830585] [2020-11-07 05:07:44,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:44,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:07:44,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937969004] [2020-11-07 05:07:44,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:07:44,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:44,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:07:44,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:44,062 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 05:07:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:44,760 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 05:07:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:07:44,760 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 05:07:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:44,762 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:07:44,762 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:07:44,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:07:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:07:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 05:07:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 05:07:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 05:07:44,793 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 05:07:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:44,795 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 05:07:44,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:07:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 05:07:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 05:07:44,797 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:44,797 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:44,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:07:44,797 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:44,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:44,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 05:07:44,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:44,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [641792078] [2020-11-07 05:07:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-11-07 05:07:45,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [641792078] [2020-11-07 05:07:45,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:45,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:07:45,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531421661] [2020-11-07 05:07:45,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:07:45,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:45,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:07:45,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:07:45,304 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-11-07 05:07:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:46,059 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-11-07 05:07:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:07:46,064 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-11-07 05:07:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:46,065 INFO L225 Difference]: With dead ends: 89 [2020-11-07 05:07:46,065 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 05:07:46,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:07:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 05:07:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-07 05:07:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 05:07:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-11-07 05:07:46,081 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-11-07 05:07:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:46,081 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-11-07 05:07:46,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:07:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-11-07 05:07:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-07 05:07:46,083 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:46,083 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:46,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:07:46,083 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:46,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:46,084 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-11-07 05:07:46,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:46,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2045721101] [2020-11-07 05:07:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-11-07 05:07:46,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2045721101] [2020-11-07 05:07:46,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:46,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:07:46,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702768859] [2020-11-07 05:07:46,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:07:46,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:46,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:07:46,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:46,608 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-11-07 05:07:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:47,488 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-11-07 05:07:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 05:07:47,488 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-11-07 05:07:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:47,490 INFO L225 Difference]: With dead ends: 94 [2020-11-07 05:07:47,490 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 05:07:47,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-11-07 05:07:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 05:07:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-07 05:07:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 05:07:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-11-07 05:07:47,517 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-11-07 05:07:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:47,517 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-11-07 05:07:47,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:07:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-11-07 05:07:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-07 05:07:47,523 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:47,523 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 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 05:07:47,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:07:47,524 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:47,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:47,524 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-11-07 05:07:47,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:47,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217197428] [2020-11-07 05:07:47,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-11-07 05:07:48,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217197428] [2020-11-07 05:07:48,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:48,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:07:48,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929766642] [2020-11-07 05:07:48,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:07:48,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:48,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:07:48,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:07:48,116 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-11-07 05:07:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:49,077 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-11-07 05:07:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:07:49,078 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-11-07 05:07:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:49,080 INFO L225 Difference]: With dead ends: 99 [2020-11-07 05:07:49,080 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 05:07:49,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:07:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 05:07:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-07 05:07:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 05:07:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-11-07 05:07:49,096 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-11-07 05:07:49,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:49,097 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-11-07 05:07:49,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:07:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-11-07 05:07:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 05:07:49,099 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:49,099 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 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 05:07:49,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:07:49,099 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-11-07 05:07:49,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:49,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [513474188] [2020-11-07 05:07:49,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-11-07 05:07:49,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [513474188] [2020-11-07 05:07:49,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:49,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 05:07:49,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196365130] [2020-11-07 05:07:49,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 05:07:49,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 05:07:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:49,753 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-11-07 05:07:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:50,783 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-11-07 05:07:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:07:50,784 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-11-07 05:07:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:50,785 INFO L225 Difference]: With dead ends: 104 [2020-11-07 05:07:50,785 INFO L226 Difference]: Without dead ends: 97 [2020-11-07 05:07:50,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 05:07:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-07 05:07:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-11-07 05:07:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-07 05:07:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-11-07 05:07:50,803 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-11-07 05:07:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:50,806 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-11-07 05:07:50,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 05:07:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-11-07 05:07:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-07 05:07:50,810 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:50,811 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 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 05:07:50,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:07:50,811 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-11-07 05:07:50,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:50,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349750212] [2020-11-07 05:07:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-11-07 05:07:51,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349750212] [2020-11-07 05:07:51,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:51,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:07:51,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424485114] [2020-11-07 05:07:51,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:07:51,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:07:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:07:51,556 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-11-07 05:07:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:52,638 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-11-07 05:07:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:07:52,639 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-11-07 05:07:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:52,641 INFO L225 Difference]: With dead ends: 109 [2020-11-07 05:07:52,641 INFO L226 Difference]: Without dead ends: 102 [2020-11-07 05:07:52,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 05:07:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-07 05:07:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-11-07 05:07:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-07 05:07:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-11-07 05:07:52,657 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-11-07 05:07:52,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:52,658 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-11-07 05:07:52,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:07:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-11-07 05:07:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-07 05:07:52,660 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:52,660 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 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 05:07:52,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:07:52,660 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-11-07 05:07:52,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:52,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91437802] [2020-11-07 05:07:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-11-07 05:07:53,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [91437802] [2020-11-07 05:07:53,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:53,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 05:07:53,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026794045] [2020-11-07 05:07:53,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 05:07:53,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 05:07:53,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:53,576 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-11-07 05:07:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:54,750 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-11-07 05:07:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:07:54,752 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-11-07 05:07:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:54,753 INFO L225 Difference]: With dead ends: 114 [2020-11-07 05:07:54,753 INFO L226 Difference]: Without dead ends: 107 [2020-11-07 05:07:54,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 05:07:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-07 05:07:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-07 05:07:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-07 05:07:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-11-07 05:07:54,778 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-11-07 05:07:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:54,779 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-11-07 05:07:54,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 05:07:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-11-07 05:07:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 05:07:54,781 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:54,781 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 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 05:07:54,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:07:54,781 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:54,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-11-07 05:07:54,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:54,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396206751] [2020-11-07 05:07:54,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-11-07 05:07:55,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396206751] [2020-11-07 05:07:55,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:55,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:07:55,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531842578] [2020-11-07 05:07:55,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:07:55,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:07:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:07:55,681 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-11-07 05:07:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:56,752 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-11-07 05:07:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:07:56,753 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-11-07 05:07:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:56,755 INFO L225 Difference]: With dead ends: 119 [2020-11-07 05:07:56,755 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 05:07:56,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 05:07:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 05:07:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-07 05:07:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 05:07:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-11-07 05:07:56,772 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-11-07 05:07:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:56,773 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-11-07 05:07:56,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:07:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-11-07 05:07:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-11-07 05:07:56,775 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:56,775 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 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 05:07:56,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:07:56,775 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-11-07 05:07:56,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:56,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342785208] [2020-11-07 05:07:56,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-11-07 05:07:57,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342785208] [2020-11-07 05:07:57,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:57,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 05:07:57,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946063750] [2020-11-07 05:07:57,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 05:07:57,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 05:07:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:07:57,606 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-11-07 05:07:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:58,809 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-11-07 05:07:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:07:58,809 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-11-07 05:07:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:58,811 INFO L225 Difference]: With dead ends: 124 [2020-11-07 05:07:58,812 INFO L226 Difference]: Without dead ends: 117 [2020-11-07 05:07:58,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 05:07:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-07 05:07:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-11-07 05:07:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-07 05:07:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-11-07 05:07:58,828 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-11-07 05:07:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:58,828 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-11-07 05:07:58,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 05:07:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-11-07 05:07:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 05:07:58,830 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:58,831 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 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 05:07:58,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 05:07:58,831 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:58,831 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-11-07 05:07:58,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:58,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [513775927] [2020-11-07 05:07:58,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-11-07 05:07:59,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [513775927] [2020-11-07 05:07:59,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:59,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 05:07:59,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062475221] [2020-11-07 05:07:59,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 05:07:59,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:59,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 05:07:59,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:07:59,742 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-11-07 05:08:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:01,063 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-11-07 05:08:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 05:08:01,064 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-11-07 05:08:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:01,066 INFO L225 Difference]: With dead ends: 129 [2020-11-07 05:08:01,066 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 05:08:01,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 05:08:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 05:08:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-07 05:08:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-07 05:08:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-11-07 05:08:01,084 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-11-07 05:08:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:01,085 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-11-07 05:08:01,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 05:08:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-11-07 05:08:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-07 05:08:01,087 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:01,087 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 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 05:08:01,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 05:08:01,088 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-11-07 05:08:01,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:01,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1670322631] [2020-11-07 05:08:01,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-11-07 05:08:02,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1670322631] [2020-11-07 05:08:02,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:02,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 05:08:02,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149554884] [2020-11-07 05:08:02,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 05:08:02,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:02,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 05:08:02,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:08:02,239 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-11-07 05:08:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:03,668 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-11-07 05:08:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 05:08:03,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-11-07 05:08:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:03,671 INFO L225 Difference]: With dead ends: 134 [2020-11-07 05:08:03,672 INFO L226 Difference]: Without dead ends: 127 [2020-11-07 05:08:03,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 05:08:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-07 05:08:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-11-07 05:08:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 05:08:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-11-07 05:08:03,690 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-11-07 05:08:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:03,691 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-11-07 05:08:03,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 05:08:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-11-07 05:08:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 05:08:03,692 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:03,693 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 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 05:08:03,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 05:08:03,693 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:03,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-11-07 05:08:03,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:03,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2080186627] [2020-11-07 05:08:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:03,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:03,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:03,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:03,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:03,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-11-07 05:08:05,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2080186627] [2020-11-07 05:08:05,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:05,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 05:08:05,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670003279] [2020-11-07 05:08:05,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 05:08:05,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:05,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 05:08:05,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-11-07 05:08:05,117 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 26 states. [2020-11-07 05:08:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:06,619 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-11-07 05:08:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:08:06,620 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 185 [2020-11-07 05:08:06,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:06,622 INFO L225 Difference]: With dead ends: 139 [2020-11-07 05:08:06,622 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 05:08:06,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=813, Invalid=1539, Unknown=0, NotChecked=0, Total=2352 [2020-11-07 05:08:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 05:08:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-11-07 05:08:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 05:08:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2020-11-07 05:08:06,642 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 185 [2020-11-07 05:08:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:06,642 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2020-11-07 05:08:06,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 05:08:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2020-11-07 05:08:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-07 05:08:06,644 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:06,644 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 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 05:08:06,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 05:08:06,645 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1339041299, now seen corresponding path program 21 times [2020-11-07 05:08:06,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:06,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588609092] [2020-11-07 05:08:06,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:06,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-11-07 05:08:07,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588609092] [2020-11-07 05:08:07,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:07,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-07 05:08:07,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708899989] [2020-11-07 05:08:07,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 05:08:07,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:07,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 05:08:07,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:08:07,892 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2020-11-07 05:08:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:09,415 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2020-11-07 05:08:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 05:08:09,419 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 193 [2020-11-07 05:08:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:09,421 INFO L225 Difference]: With dead ends: 144 [2020-11-07 05:08:09,421 INFO L226 Difference]: Without dead ends: 137 [2020-11-07 05:08:09,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=884, Invalid=1666, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 05:08:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-07 05:08:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-11-07 05:08:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-07 05:08:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2020-11-07 05:08:09,441 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 193 [2020-11-07 05:08:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:09,442 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2020-11-07 05:08:09,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 05:08:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2020-11-07 05:08:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-07 05:08:09,444 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:09,444 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 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 05:08:09,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 05:08:09,444 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1769896713, now seen corresponding path program 22 times [2020-11-07 05:08:09,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:09,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015888026] [2020-11-07 05:08:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:09,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-11-07 05:08:10,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015888026] [2020-11-07 05:08:10,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:10,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 05:08:10,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228377799] [2020-11-07 05:08:10,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 05:08:10,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 05:08:10,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2020-11-07 05:08:10,808 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 28 states. [2020-11-07 05:08:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:12,428 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2020-11-07 05:08:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:08:12,429 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2020-11-07 05:08:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:12,431 INFO L225 Difference]: With dead ends: 149 [2020-11-07 05:08:12,431 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 05:08:12,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=958, Invalid=1798, Unknown=0, NotChecked=0, Total=2756 [2020-11-07 05:08:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 05:08:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-11-07 05:08:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 05:08:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2020-11-07 05:08:12,451 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 201 [2020-11-07 05:08:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:12,451 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2020-11-07 05:08:12,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 05:08:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2020-11-07 05:08:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-07 05:08:12,453 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:12,453 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 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 05:08:12,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 05:08:12,454 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2013305389, now seen corresponding path program 23 times [2020-11-07 05:08:12,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:12,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495134355] [2020-11-07 05:08:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:12,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-11-07 05:08:13,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495134355] [2020-11-07 05:08:13,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:13,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-11-07 05:08:13,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704479153] [2020-11-07 05:08:13,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-07 05:08:13,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:13,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-07 05:08:13,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=481, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:08:13,962 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 29 states. [2020-11-07 05:08:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:15,645 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-11-07 05:08:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 05:08:15,646 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 209 [2020-11-07 05:08:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:15,648 INFO L225 Difference]: With dead ends: 154 [2020-11-07 05:08:15,648 INFO L226 Difference]: Without dead ends: 147 [2020-11-07 05:08:15,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1935, Unknown=0, NotChecked=0, Total=2970 [2020-11-07 05:08:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-07 05:08:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-11-07 05:08:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-07 05:08:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2020-11-07 05:08:15,675 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 209 [2020-11-07 05:08:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:15,676 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2020-11-07 05:08:15,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-07 05:08:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2020-11-07 05:08:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-11-07 05:08:15,678 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:15,678 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 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 05:08:15,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 05:08:15,679 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:15,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:15,680 INFO L82 PathProgramCache]: Analyzing trace with hash -405782711, now seen corresponding path program 24 times [2020-11-07 05:08:15,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:15,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1551132249] [2020-11-07 05:08:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:15,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:16,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-11-07 05:08:17,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1551132249] [2020-11-07 05:08:17,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:17,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-11-07 05:08:17,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903881800] [2020-11-07 05:08:17,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-07 05:08:17,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:17,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-07 05:08:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2020-11-07 05:08:17,306 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 30 states. [2020-11-07 05:08:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:19,066 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2020-11-07 05:08:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 05:08:19,067 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 217 [2020-11-07 05:08:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:19,069 INFO L225 Difference]: With dead ends: 159 [2020-11-07 05:08:19,069 INFO L226 Difference]: Without dead ends: 152 [2020-11-07 05:08:19,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1115, Invalid=2077, Unknown=0, NotChecked=0, Total=3192 [2020-11-07 05:08:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-07 05:08:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-11-07 05:08:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-11-07 05:08:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2020-11-07 05:08:19,090 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 217 [2020-11-07 05:08:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:19,090 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2020-11-07 05:08:19,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-07 05:08:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2020-11-07 05:08:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-11-07 05:08:19,092 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:19,092 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 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 05:08:19,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 05:08:19,093 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2086570605, now seen corresponding path program 25 times [2020-11-07 05:08:19,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:19,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [614133133] [2020-11-07 05:08:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:19,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:19,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:19,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:19,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:19,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:19,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:19,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:19,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:20,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:20,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:20,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:20,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:20,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:20,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:20,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:20,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:21,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:21,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:21,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:21,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:21,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:21,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:21,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:22,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:22,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:22,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:22,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2020-11-07 05:08:23,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [614133133] [2020-11-07 05:08:23,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:23,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2020-11-07 05:08:23,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362886947] [2020-11-07 05:08:23,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 56 states [2020-11-07 05:08:23,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2020-11-07 05:08:23,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 05:08:23,208 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 56 states. [2020-11-07 05:08:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:35,600 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2020-11-07 05:08:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2020-11-07 05:08:35,601 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 225 [2020-11-07 05:08:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:35,603 INFO L225 Difference]: With dead ends: 164 [2020-11-07 05:08:35,603 INFO L226 Difference]: Without dead ends: 157 [2020-11-07 05:08:35,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3055 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=503, Invalid=17587, Unknown=0, NotChecked=0, Total=18090 [2020-11-07 05:08:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-07 05:08:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-11-07 05:08:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-07 05:08:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2020-11-07 05:08:35,633 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 225 [2020-11-07 05:08:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:35,634 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2020-11-07 05:08:35,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2020-11-07 05:08:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2020-11-07 05:08:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-07 05:08:35,636 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:35,636 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 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 05:08:35,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 05:08:35,636 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash -568773751, now seen corresponding path program 26 times [2020-11-07 05:08:35,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:35,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1824728293] [2020-11-07 05:08:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:08:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:35,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:36,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1625 proven. 52 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2020-11-07 05:08:37,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1824728293] [2020-11-07 05:08:37,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:37,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2020-11-07 05:08:37,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970790299] [2020-11-07 05:08:37,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-11-07 05:08:37,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-07 05:08:37,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=606, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:08:37,851 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 32 states. [2020-11-07 05:08:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:40,287 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2020-11-07 05:08:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-07 05:08:40,288 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 233 [2020-11-07 05:08:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:40,289 INFO L225 Difference]: With dead ends: 157 [2020-11-07 05:08:40,289 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:08:40,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1206, Invalid=2454, Unknown=0, NotChecked=0, Total=3660 [2020-11-07 05:08:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:08:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:08:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:08:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:08:40,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2020-11-07 05:08:40,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:40,291 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:08:40,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-11-07 05:08:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:08:40,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:08:40,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-07 05:08:40,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:08:40,552 WARN L194 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 117 [2020-11-07 05:08:40,820 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 117 [2020-11-07 05:08:41,112 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 113 [2020-11-07 05:08:41,347 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 113 [2020-11-07 05:08:41,654 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 117 [2020-11-07 05:08:43,236 WARN L194 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 210 DAG size of output: 161 [2020-11-07 05:08:44,716 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 210 DAG size of output: 161 [2020-11-07 05:08:46,143 WARN L194 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 205 DAG size of output: 160 [2020-11-07 05:08:47,425 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 205 DAG size of output: 160 [2020-11-07 05:08:49,121 WARN L194 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 256 DAG size of output: 208 [2020-11-07 05:08:49,129 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,129 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,130 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,130 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,130 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,130 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,130 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:08:49,130 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:08:49,130 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,131 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)|) (= |#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 05:08:49,131 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,131 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,131 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 05:08:49,131 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:08:49,131 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:08:49,131 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:08:49,131 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:08:49,132 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:08:49,132 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-11-07 05:08:49,132 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: (<= 25 main_~input~0) [2020-11-07 05:08:49,132 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-11-07 05:08:49,132 INFO L262 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0)) [2020-11-07 05:08:49,132 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: false [2020-11-07 05:08:49,132 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~input~0 25)) [2020-11-07 05:08:49,132 INFO L262 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 25) (<= 25 main_~input~0) (<= 25 |main_#t~ret8|)) [2020-11-07 05:08:49,133 INFO L262 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: (<= 25 main_~input~0) [2020-11-07 05:08:49,133 INFO L262 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 25) (<= 25 main_~input~0) (<= 25 |main_#t~ret8|)) [2020-11-07 05:08:49,133 INFO L262 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 25) (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0) (<= 25 |main_#t~ret8|)) [2020-11-07 05:08:49,134 INFO L262 CegarLoopResult]: At program point idFINAL(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and .cse0 (<= 22 |id_#res|) (<= |id_#res| 22) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|)) (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) [2020-11-07 05:08:49,135 INFO L262 CegarLoopResult]: At program point idEXIT(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and .cse0 (<= 22 |id_#res|) (<= |id_#res| 22) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|)) (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) [2020-11-07 05:08:49,135 INFO L262 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 05:08:49,135 INFO L269 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2020-11-07 05:08:49,135 INFO L262 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 05:08:49,136 INFO L262 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (and (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= |id_#t~ret7| 24) (<= 24 |id_#t~ret7|)) (and .cse0 (<= 26 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 24)))) (or (and (<= 12 |id_#in~x|) (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) (<= 12 |id_#t~ret7|)) (and (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (<= 25 |id_#in~x|) (and (<= |id_#t~ret7| 23) (<= 23 |id_#t~ret7|) (<= 24 |id_#in~x|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 21 |id_#t~ret7|) (<= |id_#t~ret7| 21) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 22 |id_#t~ret7|) (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= |id_#t~ret7| 22)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= |id_#t~ret7| 20) (<= 20 |id_#t~ret7|)) (and (<= 1 |id_#in~x|) (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= |id_#t~ret7| 19) (<= |id_#in~x| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)))) [2020-11-07 05:08:49,136 INFO L262 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-11-07 05:08:49,136 INFO L262 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (and (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= |id_#t~ret7| 24) (<= 24 |id_#t~ret7|)) (and .cse0 (<= 26 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 24)))) (or (and (<= 12 |id_#in~x|) (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) (<= 12 |id_#t~ret7|)) (and (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (<= 25 |id_#in~x|) (and (<= |id_#t~ret7| 23) (<= 23 |id_#t~ret7|) (<= 24 |id_#in~x|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 21 |id_#t~ret7|) (<= |id_#t~ret7| 21) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 22 |id_#t~ret7|) (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= |id_#t~ret7| 22)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= |id_#t~ret7| 20) (<= 20 |id_#t~ret7|)) (and (<= 1 |id_#in~x|) (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= |id_#t~ret7| 19) (<= |id_#in~x| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)))) [2020-11-07 05:08:49,137 INFO L262 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= |id_#t~ret7| 24) (<= 24 |id_#t~ret7|) (<= 25 |id_#res|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 8 |id_#res|) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|) (<= |id_#res| 15)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#t~ret7| 20) (<= |id_#res| 21) (<= 20 |id_#t~ret7|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= |id_#t~ret7| 23) .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 23 |id_#t~ret7|) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 21 |id_#t~ret7|) (<= |id_#t~ret7| 21) .cse0 (<= 22 |id_#res|) (<= |id_#res| 22) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 5 |id_#t~ret7|) (<= |id_#res| 6) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= 22 |id_#t~ret7|) (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= |id_#t~ret7| 22) (<= 23 |id_#res|)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= |id_#t~ret7| 6) (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#t~ret7| 19) .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret7|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#t~ret7| 1) (<= |id_#res| 2) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)))) [2020-11-07 05:08:49,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:08:49 BoogieIcfgContainer [2020-11-07 05:08:49,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:08:49,171 INFO L168 Benchmark]: Toolchain (without parser) took 73642.77 ms. Allocated memory was 156.2 MB in the beginning and 676.3 MB in the end (delta: 520.1 MB). Free memory was 132.8 MB in the beginning and 565.3 MB in the end (delta: -432.5 MB). Peak memory consumption was 402.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:49,172 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 156.2 MB. Free memory is still 131.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:08:49,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.18 ms. Allocated memory is still 156.2 MB. Free memory was 132.2 MB in the beginning and 123.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:49,173 INFO L168 Benchmark]: Boogie Preprocessor took 36.84 ms. Allocated memory is still 156.2 MB. Free memory was 123.1 MB in the beginning and 121.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:49,173 INFO L168 Benchmark]: RCFGBuilder took 650.68 ms. Allocated memory is still 156.2 MB. Free memory was 121.5 MB in the beginning and 108.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:49,174 INFO L168 Benchmark]: TraceAbstraction took 72702.47 ms. Allocated memory was 156.2 MB in the beginning and 676.3 MB in the end (delta: 520.1 MB). Free memory was 107.9 MB in the beginning and 565.3 MB in the end (delta: -457.4 MB). Peak memory consumption was 377.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:49,176 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.42 ms. Allocated memory is still 156.2 MB. Free memory is still 131.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 239.18 ms. Allocated memory is still 156.2 MB. Free memory was 132.2 MB in the beginning and 123.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.84 ms. Allocated memory is still 156.2 MB. Free memory was 123.1 MB in the beginning and 121.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 650.68 ms. Allocated memory is still 156.2 MB. Free memory was 121.5 MB in the beginning and 108.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 72702.47 ms. Allocated memory was 156.2 MB in the beginning and 676.3 MB in the end (delta: 520.1 MB). Free memory was 107.9 MB in the beginning and 565.3 MB in the end (delta: -457.4 MB). Peak memory consumption was 377.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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 - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 25 <= input - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id: (((((((((((((((((((((((((((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7) || ((((\old(x) <= 11 && 11 <= \old(x)) && \old(x) == x) && \result <= 11) && 11 <= \result)) || ((((\old(x) == x && \old(x) <= 10) && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((\result <= 16 && \old(x) == x) && 16 <= \old(x)) && \old(x) <= 16) && 16 <= \result)) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\old(x) == x && 22 <= \result) && \result <= 22) && \old(x) <= 22) && 22 <= \old(x))) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((\old(x) == x && \old(x) <= 24) && \result <= 24) && 24 <= \old(x)) && 24 <= \result)) || ((((19 <= \result && \result <= 19) && \old(x) == x) && \old(x) <= 19) && 19 <= \old(x))) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1)) || (\old(x) == x && 26 <= \old(x))) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || ((((\result <= 23 && \old(x) == x) && 23 <= \old(x)) && \old(x) <= 23) && 23 <= \result)) || ((((\result <= 17 && 17 <= \result) && \old(x) == x) && \old(x) <= 17) && 17 <= \old(x))) || (((25 <= \old(x) && \old(x) == x) && \result <= 25) && 25 <= \result)) || ((((\old(x) == x && \old(x) <= 20) && 20 <= \result) && \result <= 20) && 20 <= \old(x))) || ((((\result <= 14 && 14 <= \old(x)) && \old(x) == x) && 14 <= \result) && \old(x) <= 14)) || ((((12 <= \old(x) && \old(x) == x) && \result <= 12) && \old(x) <= 12) && 12 <= \result)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 18 && 18 <= \old(x)) && \old(x) == x) && 18 <= \result) && \old(x) <= 18)) || ((((\old(x) <= 21 && 21 <= \old(x)) && 21 <= \result) && \old(x) == x) && \result <= 21) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 63.7s, OverallIterations: 27, TraceHistogramMax: 27, AutomataDifference: 38.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 875 SDtfs, 3301 SDslu, 2556 SDs, 0 SdLazy, 11161 SolverSat, 947 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1778 GetRequests, 811 SyntacticMatches, 0 SemanticMatches, 967 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8984 ImplicationChecksByTransitivity, 33.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 150 PreInvPairs, 659 NumberOfFragments, 2178 HoareAnnotationTreeSize, 150 FomulaSimplifications, 11251 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 37 FomulaSimplificationsInter, 9371 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.8s InterpolantComputationTime, 3483 NumberOfCodeBlocks, 3483 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3456 ConstructedInterpolants, 0 QuantifiedInterpolants, 1589728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 11102/24804 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...