/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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.1.25-3af5e1f [2020-09-04 21:55:50,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:55:50,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:55:50,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:55:50,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:55:50,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:55:50,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:55:50,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:55:50,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:55:50,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:55:50,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:55:50,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:55:50,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:55:50,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:55:50,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:55:50,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:55:50,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:55:50,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:55:50,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:55:50,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:55:50,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:55:50,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:55:50,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:55:50,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:55:50,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:55:50,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:55:50,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:55:50,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:55:50,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:55:50,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:55:50,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:55:50,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:55:50,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:55:50,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:55:50,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:55:50,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:55:50,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:55:50,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:55:50,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:55:50,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:55:50,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:55:50,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:55:50,919 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:55:50,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:55:50,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:55:50,921 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:55:50,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:55:50,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:55:50,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:55:50,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:55:50,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:55:50,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:55:50,924 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:55:50,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:55:50,924 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:55:50,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:55:50,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:55:50,925 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:55:50,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:55:50,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:55:50,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:55:50,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:55:50,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:55:50,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:55:50,926 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-09-04 21:55:51,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:55:51,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:55:51,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:55:51,405 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:55:51,405 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:55:51,406 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-09-04 21:55:51,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ec4661864/038ad1f6beaa49d6b8abd76803083158/FLAG248eebee5 [2020-09-04 21:55:52,038 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:55:52,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-09-04 21:55:52,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ec4661864/038ad1f6beaa49d6b8abd76803083158/FLAG248eebee5 [2020-09-04 21:55:52,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ec4661864/038ad1f6beaa49d6b8abd76803083158 [2020-09-04 21:55:52,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:55:52,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:55:52,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:52,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:55:52,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:55:52,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:52" (1/1) ... [2020-09-04 21:55:52,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cab5458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52, skipping insertion in model container [2020-09-04 21:55:52,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:52" (1/1) ... [2020-09-04 21:55:52,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:55:52,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:55:52,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:52,664 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:55:52,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:52,697 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:55:52,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52 WrapperNode [2020-09-04 21:55:52,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:52,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:55:52,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:55:52,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:55:52,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52" (1/1) ... [2020-09-04 21:55:52,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52" (1/1) ... [2020-09-04 21:55:52,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52" (1/1) ... [2020-09-04 21:55:52,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52" (1/1) ... [2020-09-04 21:55:52,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52" (1/1) ... [2020-09-04 21:55:52,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52" (1/1) ... [2020-09-04 21:55:52,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52" (1/1) ... [2020-09-04 21:55:52,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:55:52,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:55:52,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:55:52,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:55:52,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 21:55:52,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:55:52,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:55:52,894 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 21:55:52,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:55:52,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:55:52,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:55:52,895 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 21:55:52,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:55:52,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:55:52,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:55:53,091 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:55:53,092 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:55:53,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:53 BoogieIcfgContainer [2020-09-04 21:55:53,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:55:53,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:55:53,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:55:53,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:55:53,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:55:52" (1/3) ... [2020-09-04 21:55:53,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d821886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:53, skipping insertion in model container [2020-09-04 21:55:53,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:52" (2/3) ... [2020-09-04 21:55:53,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d821886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:53, skipping insertion in model container [2020-09-04 21:55:53,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:53" (3/3) ... [2020-09-04 21:55:53,107 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i25_o25-1.c [2020-09-04 21:55:53,120 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:55:53,132 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:55:53,160 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:55:53,194 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:55:53,194 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:55:53,194 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:55:53,195 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:55:53,195 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:55:53,195 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:55:53,195 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:55:53,195 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:55:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 21:55:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:55:53,232 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:53,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:53,234 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 21:55:53,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:53,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [491290433] [2020-09-04 21:55:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:55:53,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [491290433] [2020-09-04 21:55:53,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:53,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:53,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347986483] [2020-09-04 21:55:53,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:53,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:53,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:53,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:53,542 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 21:55:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:53,658 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 21:55:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:55:53,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:55:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:53,672 INFO L225 Difference]: With dead ends: 37 [2020-09-04 21:55:53,673 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 21:55:53,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 21:55:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 21:55:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 21:55:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 21:55:53,729 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 21:55:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:53,730 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 21:55:53,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 21:55:53,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 21:55:53,733 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:53,733 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] [2020-09-04 21:55:53,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:55:53,734 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:53,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:53,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 21:55:53,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:53,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [947271685] [2020-09-04 21:55:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:55:53,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [947271685] [2020-09-04 21:55:53,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:53,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:55:53,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374211651] [2020-09-04 21:55:53,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:55:53,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:53,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:55:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:53,875 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 21:55:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:53,947 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 21:55:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:55:53,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 21:55:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:53,949 INFO L225 Difference]: With dead ends: 34 [2020-09-04 21:55:53,950 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 21:55:53,951 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:55:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 21:55:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 21:55:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:55:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 21:55:53,963 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 21:55:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:53,966 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 21:55:53,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:55:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 21:55:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 21:55:53,968 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:53,968 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] [2020-09-04 21:55:53,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:55:53,969 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 21:55:53,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:53,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1892399315] [2020-09-04 21:55:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 21:55:54,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1892399315] [2020-09-04 21:55:54,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:54,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:55:54,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382636265] [2020-09-04 21:55:54,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:55:54,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:54,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:55:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:55:54,152 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 21:55:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:54,229 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 21:55:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:55:54,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 21:55:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:54,234 INFO L225 Difference]: With dead ends: 39 [2020-09-04 21:55:54,234 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 21:55:54,235 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:55:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 21:55:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 21:55:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 21:55:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 21:55:54,247 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 21:55:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:54,248 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 21:55:54,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:55:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 21:55:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 21:55:54,250 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:54,250 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] [2020-09-04 21:55:54,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:55:54,251 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 21:55:54,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:54,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1723689696] [2020-09-04 21:55:54,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 21:55:54,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1723689696] [2020-09-04 21:55:54,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:54,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:55:54,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737120629] [2020-09-04 21:55:54,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:55:54,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:55:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:55:54,538 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 21:55:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:54,635 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 21:55:54,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:55:54,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 21:55:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:54,638 INFO L225 Difference]: With dead ends: 44 [2020-09-04 21:55:54,638 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 21:55:54,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:55:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 21:55:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 21:55:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 21:55:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 21:55:54,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 21:55:54,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:54,650 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 21:55:54,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:55:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 21:55:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 21:55:54,652 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:54,652 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] [2020-09-04 21:55:54,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:55:54,652 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:54,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:54,653 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 21:55:54,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:54,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15006407] [2020-09-04 21:55:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 21:55:54,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15006407] [2020-09-04 21:55:54,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:54,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:55:54,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104538763] [2020-09-04 21:55:54,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:55:54,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:54,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:55:54,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:55:54,868 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 21:55:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:54,967 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 21:55:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:55:54,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 21:55:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:54,970 INFO L225 Difference]: With dead ends: 49 [2020-09-04 21:55:54,970 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 21:55:54,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:55:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 21:55:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 21:55:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 21:55:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 21:55:54,982 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 21:55:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:54,983 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 21:55:54,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:55:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 21:55:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 21:55:54,985 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:54,985 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] [2020-09-04 21:55:54,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:55:54,986 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:54,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:54,986 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 21:55:54,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:54,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1136007756] [2020-09-04 21:55:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 21:55:55,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1136007756] [2020-09-04 21:55:55,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:55,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:55:55,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350722717] [2020-09-04 21:55:55,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:55:55,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:55,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:55:55,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:55:55,187 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 21:55:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:55,286 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 21:55:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:55:55,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 21:55:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:55,289 INFO L225 Difference]: With dead ends: 54 [2020-09-04 21:55:55,289 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 21:55:55,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:55:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 21:55:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 21:55:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 21:55:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 21:55:55,302 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 21:55:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:55,302 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 21:55:55,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:55:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 21:55:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 21:55:55,305 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:55,305 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] [2020-09-04 21:55:55,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:55:55,306 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 21:55:55,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:55,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1447161575] [2020-09-04 21:55:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 21:55:55,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1447161575] [2020-09-04 21:55:55,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:55,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:55:55,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428367545] [2020-09-04 21:55:55,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:55:55,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:55,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:55:55,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:55:55,584 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 21:55:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:55,697 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 21:55:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:55:55,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 21:55:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:55,700 INFO L225 Difference]: With dead ends: 59 [2020-09-04 21:55:55,700 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 21:55:55,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:55:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 21:55:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 21:55:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 21:55:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 21:55:55,712 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 21:55:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:55,712 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 21:55:55,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:55:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 21:55:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:55:55,714 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:55,714 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] [2020-09-04 21:55:55,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:55:55,715 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:55,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:55,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 21:55:55,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:55,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246645305] [2020-09-04 21:55:55,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 21:55:56,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246645305] [2020-09-04 21:55:56,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:56,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:55:56,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845331165] [2020-09-04 21:55:56,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:55:56,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:56,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:55:56,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:55:56,017 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 21:55:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:56,162 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 21:55:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:55:56,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 21:55:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:56,165 INFO L225 Difference]: With dead ends: 64 [2020-09-04 21:55:56,165 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 21:55:56,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:55:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 21:55:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 21:55:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 21:55:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 21:55:56,177 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 21:55:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:56,178 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 21:55:56,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:55:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 21:55:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 21:55:56,179 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:56,180 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] [2020-09-04 21:55:56,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:55:56,180 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 21:55:56,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:56,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057079438] [2020-09-04 21:55:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 21:55:56,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1057079438] [2020-09-04 21:55:56,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:56,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:55:56,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561297612] [2020-09-04 21:55:56,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:55:56,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:55:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:55:56,533 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 21:55:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:56,671 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 21:55:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:55:56,672 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 21:55:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:56,674 INFO L225 Difference]: With dead ends: 69 [2020-09-04 21:55:56,674 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 21:55:56,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:55:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 21:55:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 21:55:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 21:55:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 21:55:56,686 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 21:55:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:56,686 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 21:55:56,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:55:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 21:55:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 21:55:56,688 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:56,688 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] [2020-09-04 21:55:56,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:55:56,689 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:56,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:56,689 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 21:55:56,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:56,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1953675274] [2020-09-04 21:55:56,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 21:55:57,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1953675274] [2020-09-04 21:55:57,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:57,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:55:57,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407620227] [2020-09-04 21:55:57,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:55:57,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:57,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:55:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:55:57,081 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 21:55:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:57,237 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 21:55:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:55:57,238 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 21:55:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:57,240 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:55:57,240 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:55:57,241 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:55:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:55:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 21:55:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 21:55:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 21:55:57,251 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 21:55:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:57,252 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 21:55:57,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:55:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 21:55:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 21:55:57,253 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:57,253 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] [2020-09-04 21:55:57,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:55:57,254 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 21:55:57,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:57,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [668173720] [2020-09-04 21:55:57,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 21:55:57,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [668173720] [2020-09-04 21:55:57,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:57,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:55:57,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840276607] [2020-09-04 21:55:57,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:55:57,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:55:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:55:57,697 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2020-09-04 21:55:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:57,883 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 21:55:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:55:57,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2020-09-04 21:55:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:57,885 INFO L225 Difference]: With dead ends: 79 [2020-09-04 21:55:57,885 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 21:55:57,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:55:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 21:55:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-09-04 21:55:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 21:55:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-09-04 21:55:57,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-09-04 21:55:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:57,898 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-09-04 21:55:57,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:55:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-09-04 21:55:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 21:55:57,901 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:57,901 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] [2020-09-04 21:55:57,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:55:57,902 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-09-04 21:55:57,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:57,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [554027280] [2020-09-04 21:55:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 21:55:58,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [554027280] [2020-09-04 21:55:58,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:58,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:55:58,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185148981] [2020-09-04 21:55:58,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:55:58,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:55:58,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:55:58,450 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-09-04 21:55:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:58,641 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-09-04 21:55:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:55:58,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 21:55:58,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:58,643 INFO L225 Difference]: With dead ends: 84 [2020-09-04 21:55:58,643 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:55:58,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:55:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:55:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 21:55:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 21:55:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 21:55:58,653 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 104 [2020-09-04 21:55:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:58,654 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 21:55:58,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:55:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 21:55:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 21:55:58,655 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:58,655 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] [2020-09-04 21:55:58,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:55:58,656 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1287598415, now seen corresponding path program 12 times [2020-09-04 21:55:58,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:58,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [852065236] [2020-09-04 21:55:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-04 21:55:59,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [852065236] [2020-09-04 21:55:59,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:59,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:55:59,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349514902] [2020-09-04 21:55:59,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:55:59,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:55:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:55:59,260 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 17 states. [2020-09-04 21:55:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:59,463 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-09-04 21:55:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:55:59,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2020-09-04 21:55:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:59,465 INFO L225 Difference]: With dead ends: 89 [2020-09-04 21:55:59,465 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 21:55:59,467 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-04 21:55:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 21:55:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-09-04 21:55:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 21:55:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2020-09-04 21:55:59,475 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 112 [2020-09-04 21:55:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:59,476 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2020-09-04 21:55:59,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:55:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2020-09-04 21:55:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 21:55:59,478 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:59,478 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] [2020-09-04 21:55:59,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:55:59,478 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1612559463, now seen corresponding path program 13 times [2020-09-04 21:55:59,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:59,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [789673439] [2020-09-04 21:55:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-04 21:56:00,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [789673439] [2020-09-04 21:56:00,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:00,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 21:56:00,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869635903] [2020-09-04 21:56:00,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 21:56:00,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 21:56:00,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:56:00,158 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 18 states. [2020-09-04 21:56:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:00,400 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-09-04 21:56:00,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:56:00,401 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2020-09-04 21:56:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:00,402 INFO L225 Difference]: With dead ends: 94 [2020-09-04 21:56:00,402 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 21:56:00,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-09-04 21:56:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 21:56:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-09-04 21:56:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 21:56:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2020-09-04 21:56:00,414 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 120 [2020-09-04 21:56:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:00,415 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2020-09-04 21:56:00,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 21:56:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2020-09-04 21:56:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 21:56:00,418 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:00,418 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] [2020-09-04 21:56:00,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:56:00,419 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash 996432753, now seen corresponding path program 14 times [2020-09-04 21:56:00,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:00,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190885268] [2020-09-04 21:56:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 21:56:01,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190885268] [2020-09-04 21:56:01,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:01,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:56:01,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447745877] [2020-09-04 21:56:01,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:56:01,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:01,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:56:01,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:56:01,159 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 19 states. [2020-09-04 21:56:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:01,401 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 21:56:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:56:01,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2020-09-04 21:56:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:01,403 INFO L225 Difference]: With dead ends: 99 [2020-09-04 21:56:01,404 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 21:56:01,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 21:56:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 21:56:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-09-04 21:56:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 21:56:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2020-09-04 21:56:01,413 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 128 [2020-09-04 21:56:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:01,413 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2020-09-04 21:56:01,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:56:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2020-09-04 21:56:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 21:56:01,415 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:01,415 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] [2020-09-04 21:56:01,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:56:01,416 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash 418248103, now seen corresponding path program 15 times [2020-09-04 21:56:01,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:01,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2065432741] [2020-09-04 21:56:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-09-04 21:56:02,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2065432741] [2020-09-04 21:56:02,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:02,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:56:02,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787586324] [2020-09-04 21:56:02,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:56:02,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:02,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:56:02,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:56:02,168 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 20 states. [2020-09-04 21:56:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:02,441 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-09-04 21:56:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:56:02,442 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2020-09-04 21:56:02,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:02,443 INFO L225 Difference]: With dead ends: 104 [2020-09-04 21:56:02,444 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 21:56:02,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 21:56:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 21:56:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 21:56:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 21:56:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2020-09-04 21:56:02,456 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 136 [2020-09-04 21:56:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:02,457 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2020-09-04 21:56:02,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:56:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2020-09-04 21:56:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 21:56:02,459 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:02,459 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] [2020-09-04 21:56:02,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:56:02,459 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:02,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2106505265, now seen corresponding path program 16 times [2020-09-04 21:56:02,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:02,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1460105143] [2020-09-04 21:56:02,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-09-04 21:56:03,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1460105143] [2020-09-04 21:56:03,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:03,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 21:56:03,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269462515] [2020-09-04 21:56:03,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 21:56:03,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:03,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 21:56:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:56:03,493 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 21 states. [2020-09-04 21:56:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:03,847 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-09-04 21:56:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:56:03,850 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 144 [2020-09-04 21:56:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:03,852 INFO L225 Difference]: With dead ends: 109 [2020-09-04 21:56:03,852 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 21:56:03,858 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 21:56:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 21:56:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-09-04 21:56:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-04 21:56:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2020-09-04 21:56:03,872 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 144 [2020-09-04 21:56:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:03,873 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2020-09-04 21:56:03,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 21:56:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2020-09-04 21:56:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-09-04 21:56:03,877 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:03,877 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] [2020-09-04 21:56:03,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 21:56:03,878 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1225615079, now seen corresponding path program 17 times [2020-09-04 21:56:03,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:03,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905396731] [2020-09-04 21:56:03,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-09-04 21:56:04,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905396731] [2020-09-04 21:56:05,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:05,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 21:56:05,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952253824] [2020-09-04 21:56:05,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 21:56:05,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:05,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 21:56:05,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:56:05,013 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 22 states. [2020-09-04 21:56:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:05,361 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-09-04 21:56:05,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:56:05,361 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 152 [2020-09-04 21:56:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:05,363 INFO L225 Difference]: With dead ends: 114 [2020-09-04 21:56:05,363 INFO L226 Difference]: Without dead ends: 108 [2020-09-04 21:56:05,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 21:56:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-09-04 21:56:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-09-04 21:56:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-09-04 21:56:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2020-09-04 21:56:05,375 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 152 [2020-09-04 21:56:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:05,376 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2020-09-04 21:56:05,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 21:56:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2020-09-04 21:56:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-09-04 21:56:05,378 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:05,378 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] [2020-09-04 21:56:05,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 21:56:05,378 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:05,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:05,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2080643855, now seen corresponding path program 18 times [2020-09-04 21:56:05,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:05,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [591138697] [2020-09-04 21:56:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-09-04 21:56:06,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [591138697] [2020-09-04 21:56:06,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:06,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:56:06,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962025606] [2020-09-04 21:56:06,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:56:06,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:06,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:56:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:56:06,612 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 23 states. [2020-09-04 21:56:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:06,928 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-09-04 21:56:06,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 21:56:06,928 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 160 [2020-09-04 21:56:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:06,930 INFO L225 Difference]: With dead ends: 119 [2020-09-04 21:56:06,930 INFO L226 Difference]: Without dead ends: 113 [2020-09-04 21:56:06,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 21:56:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-04 21:56:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-09-04 21:56:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-09-04 21:56:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2020-09-04 21:56:06,940 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 160 [2020-09-04 21:56:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:06,940 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2020-09-04 21:56:06,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:56:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2020-09-04 21:56:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 21:56:06,942 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:06,942 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] [2020-09-04 21:56:06,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 21:56:06,943 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1136658471, now seen corresponding path program 19 times [2020-09-04 21:56:06,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:06,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1420954362] [2020-09-04 21:56:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:06,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:07,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-09-04 21:56:08,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1420954362] [2020-09-04 21:56:08,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:08,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-04 21:56:08,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711400891] [2020-09-04 21:56:08,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 21:56:08,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 21:56:08,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:56:08,197 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 24 states. [2020-09-04 21:56:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:08,514 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-09-04 21:56:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:56:08,514 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 168 [2020-09-04 21:56:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:08,516 INFO L225 Difference]: With dead ends: 124 [2020-09-04 21:56:08,516 INFO L226 Difference]: Without dead ends: 118 [2020-09-04 21:56:08,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 21:56:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-09-04 21:56:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-09-04 21:56:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-09-04 21:56:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2020-09-04 21:56:08,526 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 168 [2020-09-04 21:56:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:08,526 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2020-09-04 21:56:08,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 21:56:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2020-09-04 21:56:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-09-04 21:56:08,528 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:08,529 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] [2020-09-04 21:56:08,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 21:56:08,529 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1108876879, now seen corresponding path program 20 times [2020-09-04 21:56:08,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:08,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [932876746] [2020-09-04 21:56:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-09-04 21:56:09,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [932876746] [2020-09-04 21:56:09,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:09,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 21:56:09,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360769680] [2020-09-04 21:56:09,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 21:56:09,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:09,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 21:56:09,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:56:09,653 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 25 states. [2020-09-04 21:56:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:09,993 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-09-04 21:56:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 21:56:09,994 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 176 [2020-09-04 21:56:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:09,995 INFO L225 Difference]: With dead ends: 129 [2020-09-04 21:56:09,995 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 21:56:09,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2020-09-04 21:56:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 21:56:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-09-04 21:56:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 21:56:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2020-09-04 21:56:10,006 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 176 [2020-09-04 21:56:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:10,007 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2020-09-04 21:56:10,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 21:56:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2020-09-04 21:56:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-09-04 21:56:10,010 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:10,010 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] [2020-09-04 21:56:10,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 21:56:10,010 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:10,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:10,011 INFO L82 PathProgramCache]: Analyzing trace with hash 390715751, now seen corresponding path program 21 times [2020-09-04 21:56:10,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:10,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349115131] [2020-09-04 21:56:10,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-09-04 21:56:11,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349115131] [2020-09-04 21:56:11,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:11,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-04 21:56:11,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318836321] [2020-09-04 21:56:11,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 21:56:11,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:11,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 21:56:11,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:56:11,216 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 26 states. [2020-09-04 21:56:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:11,559 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-09-04 21:56:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 21:56:11,561 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2020-09-04 21:56:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:11,566 INFO L225 Difference]: With dead ends: 134 [2020-09-04 21:56:11,566 INFO L226 Difference]: Without dead ends: 128 [2020-09-04 21:56:11,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2020-09-04 21:56:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-09-04 21:56:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-09-04 21:56:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-09-04 21:56:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2020-09-04 21:56:11,577 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 184 [2020-09-04 21:56:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:11,578 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2020-09-04 21:56:11,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 21:56:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2020-09-04 21:56:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-09-04 21:56:11,580 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:11,580 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] [2020-09-04 21:56:11,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 21:56:11,581 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:11,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1081168271, now seen corresponding path program 22 times [2020-09-04 21:56:11,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:11,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1767919906] [2020-09-04 21:56:11,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:11,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-09-04 21:56:12,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1767919906] [2020-09-04 21:56:12,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:12,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-04 21:56:12,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378420383] [2020-09-04 21:56:12,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 21:56:12,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:12,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 21:56:12,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:56:12,977 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 27 states. [2020-09-04 21:56:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:13,383 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-09-04 21:56:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:56:13,384 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 192 [2020-09-04 21:56:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:13,386 INFO L225 Difference]: With dead ends: 139 [2020-09-04 21:56:13,386 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 21:56:13,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2020-09-04 21:56:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 21:56:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-09-04 21:56:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 21:56:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2020-09-04 21:56:13,395 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 192 [2020-09-04 21:56:13,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:13,395 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2020-09-04 21:56:13,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 21:56:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2020-09-04 21:56:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 21:56:13,398 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:13,398 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] [2020-09-04 21:56:13,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 21:56:13,399 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:13,399 INFO L82 PathProgramCache]: Analyzing trace with hash -856761689, now seen corresponding path program 23 times [2020-09-04 21:56:13,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:13,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [898693186] [2020-09-04 21:56:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-09-04 21:56:14,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [898693186] [2020-09-04 21:56:14,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:14,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-09-04 21:56:14,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056627335] [2020-09-04 21:56:14,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 21:56:14,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:14,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 21:56:14,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:56:14,839 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 28 states. [2020-09-04 21:56:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:15,334 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2020-09-04 21:56:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 21:56:15,335 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 200 [2020-09-04 21:56:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:15,336 INFO L225 Difference]: With dead ends: 144 [2020-09-04 21:56:15,336 INFO L226 Difference]: Without dead ends: 138 [2020-09-04 21:56:15,339 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2020-09-04 21:56:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-04 21:56:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-09-04 21:56:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-09-04 21:56:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2020-09-04 21:56:15,351 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 200 [2020-09-04 21:56:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:15,352 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2020-09-04 21:56:15,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 21:56:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2020-09-04 21:56:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-09-04 21:56:15,353 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:15,353 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] [2020-09-04 21:56:15,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 21:56:15,355 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash 36457265, now seen corresponding path program 24 times [2020-09-04 21:56:15,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:15,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1467145410] [2020-09-04 21:56:15,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-09-04 21:56:16,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1467145410] [2020-09-04 21:56:16,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:16,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-09-04 21:56:16,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716666546] [2020-09-04 21:56:16,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-04 21:56:16,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:16,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-04 21:56:16,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:56:16,998 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 29 states. [2020-09-04 21:56:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:17,507 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2020-09-04 21:56:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 21:56:17,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 208 [2020-09-04 21:56:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:17,510 INFO L225 Difference]: With dead ends: 149 [2020-09-04 21:56:17,510 INFO L226 Difference]: Without dead ends: 143 [2020-09-04 21:56:17,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2020-09-04 21:56:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-09-04 21:56:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2020-09-04 21:56:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-09-04 21:56:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2020-09-04 21:56:17,520 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 208 [2020-09-04 21:56:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:17,521 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2020-09-04 21:56:17,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-04 21:56:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2020-09-04 21:56:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-09-04 21:56:17,522 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:17,523 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] [2020-09-04 21:56:17,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 21:56:17,523 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:17,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1460466713, now seen corresponding path program 25 times [2020-09-04 21:56:17,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:17,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [918157833] [2020-09-04 21:56:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:19,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:20,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2020-09-04 21:56:21,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [918157833] [2020-09-04 21:56:21,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:21,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2020-09-04 21:56:21,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404558074] [2020-09-04 21:56:21,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2020-09-04 21:56:21,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2020-09-04 21:56:21,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2020-09-04 21:56:21,439 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 55 states. [2020-09-04 21:56:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:25,743 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-09-04 21:56:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-09-04 21:56:25,743 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 216 [2020-09-04 21:56:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:25,745 INFO L225 Difference]: With dead ends: 154 [2020-09-04 21:56:25,745 INFO L226 Difference]: Without dead ends: 148 [2020-09-04 21:56:25,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=211, Invalid=6269, Unknown=0, NotChecked=0, Total=6480 [2020-09-04 21:56:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-09-04 21:56:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2020-09-04 21:56:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-09-04 21:56:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2020-09-04 21:56:25,769 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 216 [2020-09-04 21:56:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:25,770 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2020-09-04 21:56:25,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 55 states. [2020-09-04 21:56:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2020-09-04 21:56:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-09-04 21:56:25,771 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:25,772 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] [2020-09-04 21:56:25,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 21:56:25,772 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1543718927, now seen corresponding path program 26 times [2020-09-04 21:56:25,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:25,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2138360866] [2020-09-04 21:56:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1625 proven. 52 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2020-09-04 21:56:27,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2138360866] [2020-09-04 21:56:27,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:27,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-09-04 21:56:27,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549341082] [2020-09-04 21:56:27,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-09-04 21:56:27,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:27,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-09-04 21:56:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=546, Unknown=0, NotChecked=0, Total=930 [2020-09-04 21:56:27,627 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 31 states. [2020-09-04 21:56:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:30,470 INFO L93 Difference]: Finished difference Result 346 states and 1022 transitions. [2020-09-04 21:56:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-09-04 21:56:30,471 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 224 [2020-09-04 21:56:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:30,472 INFO L225 Difference]: With dead ends: 346 [2020-09-04 21:56:30,472 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:56:30,480 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1142, Invalid=2164, Unknown=0, NotChecked=0, Total=3306 [2020-09-04 21:56:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:56:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:56:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:56:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:56:30,481 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2020-09-04 21:56:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:30,485 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:56:30,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-09-04 21:56:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:56:30,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:56:30,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-04 21:56:30,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:56:30,651 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2020-09-04 21:56:31,296 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 87 [2020-09-04 21:56:31,603 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2020-09-04 21:56:32,515 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 87 [2020-09-04 21:56:36,983 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 284 DAG size of output: 208 [2020-09-04 21:56:38,364 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 238 DAG size of output: 163 [2020-09-04 21:56:38,524 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 3 [2020-09-04 21:56:39,944 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 238 DAG size of output: 163 [2020-09-04 21:56:40,089 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 3 [2020-09-04 21:56:41,209 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 233 DAG size of output: 157 [2020-09-04 21:56:42,286 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 233 DAG size of output: 157 [2020-09-04 21:56:42,291 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:56:42,291 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:56:42,292 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:56:42,292 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:56:42,292 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:56:42,292 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:56:42,292 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: false [2020-09-04 21:56:42,292 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-09-04 21:56:42,292 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 9 15) the Hoare annotation is: (<= 25 main_~input~0) [2020-09-04 21:56:42,293 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: false [2020-09-04 21:56:42,293 INFO L264 CegarLoopResult]: At program point L12(lines 12 14) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0)) [2020-09-04 21:56:42,294 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~input~0 25)) [2020-09-04 21:56:42,294 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (<= 25 main_~input~0) (<= |main_#t~ret1| 25) (<= 25 |main_#t~ret1|)) [2020-09-04 21:56:42,295 INFO L264 CegarLoopResult]: At program point L12-2(lines 9 15) the Hoare annotation is: (<= 25 main_~input~0) [2020-09-04 21:56:42,295 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (and (<= 25 main_~input~0) (<= |main_#t~ret1| 25) (<= 25 |main_#t~ret1|)) [2020-09-04 21:56:42,295 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0) (<= |main_#t~ret1| 25) (<= 25 |main_#t~ret1|)) [2020-09-04 21:56:42,296 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 7) the Hoare annotation is: (let ((.cse16 (<= 12 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse7 (and .cse0 (<= 26 |id_#in~x|))) (.cse1 (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15))) (.cse2 (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|))) (.cse8 (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|))) (.cse9 (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|))) (.cse3 (and .cse0 (<= 22 |id_#res|) (<= |id_#in~x| 22) (<= |id_#res| 22) (<= 22 |id_#in~x|))) (.cse10 (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|))) (.cse4 (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|))) (.cse11 (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|))) (.cse12 (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14))) (.cse13 (and .cse16 .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|))) (.cse5 (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|))) (.cse6 (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|))) (.cse14 (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18))) (.cse15 (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) (and (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) .cse1 .cse2 (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (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|)) .cse3 .cse4 (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) .cse5 (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) .cse6 (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) .cse7 (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) .cse14 .cse15) (or .cse7 .cse1 .cse2 .cse8 (not .cse16) .cse9 .cse3 .cse10 .cse4 .cse11 .cse12 .cse13 .cse5 .cse6 .cse14 .cse15)))) [2020-09-04 21:56:42,296 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 7) the Hoare annotation is: (let ((.cse16 (<= 12 |id_#in~x|)) (.cse0 (= |id_#in~x| id_~x))) (let ((.cse7 (and .cse0 (<= 26 |id_#in~x|))) (.cse1 (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15))) (.cse2 (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|))) (.cse8 (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|))) (.cse9 (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|))) (.cse3 (and .cse0 (<= 22 |id_#res|) (<= |id_#in~x| 22) (<= |id_#res| 22) (<= 22 |id_#in~x|))) (.cse10 (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|))) (.cse4 (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|))) (.cse11 (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|))) (.cse12 (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14))) (.cse13 (and .cse16 .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|))) (.cse5 (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|))) (.cse6 (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|))) (.cse14 (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18))) (.cse15 (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) (and (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) .cse1 .cse2 (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (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|)) .cse3 .cse4 (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) .cse5 (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) .cse6 (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) .cse7 (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) .cse14 .cse15) (or .cse7 .cse1 .cse2 .cse8 (not .cse16) .cse9 .cse3 .cse10 .cse4 .cse11 .cse12 .cse13 .cse5 .cse6 .cse14 .cse15)))) [2020-09-04 21:56:42,297 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-09-04 21:56:42,297 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 21:56:42,297 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 21:56:42,297 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret0| 11)) (and (<= |id_#t~ret0| 23) (<= 23 |id_#t~ret0|) .cse0 (<= |id_#in~x| 24) (<= 24 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 22) (<= 22 |id_#in~x|) (<= |id_#t~ret0| 21) (<= 21 |id_#t~ret0|)) (and .cse0 (<= 23 |id_#in~x|) (<= |id_#t~ret0| 22) (<= |id_#in~x| 23) (<= 22 |id_#t~ret0|)) (and .cse0 (<= 1 |id_#t~ret0|) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse0 (<= 14 |id_#t~ret0|) (<= |id_#in~x| 15)) (and (<= |id_#t~ret0| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|)) (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|)) (and (<= 24 |id_#t~ret0|) (<= 25 |id_#in~x|) .cse0 (<= |id_#t~ret0| 24)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= 12 |id_#t~ret0|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8)) (and (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret0| 19) .cse0 (<= |id_#in~x| 20) (<= 19 |id_#t~ret0|) (<= 20 |id_#in~x|)) (and (<= 13 |id_#t~ret0|) (<= 14 |id_#in~x|) .cse0 (<= |id_#t~ret0| 13) (<= |id_#in~x| 14)) (and (<= 17 |id_#t~ret0|) (<= 18 |id_#in~x|) .cse0 (<= |id_#in~x| 18) (<= |id_#t~ret0| 17)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) .cse0 (<= 20 |id_#t~ret0|) (<= |id_#t~ret0| 20)) (and .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret0|) (<= |id_#t~ret0| 15)) (and (<= 18 |id_#t~ret0|) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|) (<= |id_#t~ret0| 18)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7)) (and (<= |id_#t~ret0| 16) .cse0 (<= 16 |id_#t~ret0|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)))) [2020-09-04 21:56:42,298 INFO L264 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-09-04 21:56:42,298 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret0| 11)) (and (<= |id_#t~ret0| 23) (<= 23 |id_#t~ret0|) .cse0 (<= |id_#in~x| 24) (<= 24 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 22) (<= 22 |id_#in~x|) (<= |id_#t~ret0| 21) (<= 21 |id_#t~ret0|)) (and .cse0 (<= 23 |id_#in~x|) (<= |id_#t~ret0| 22) (<= |id_#in~x| 23) (<= 22 |id_#t~ret0|)) (and .cse0 (<= 1 |id_#t~ret0|) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse0 (<= 14 |id_#t~ret0|) (<= |id_#in~x| 15)) (and (<= |id_#t~ret0| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|)) (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|)) (and (<= 24 |id_#t~ret0|) (<= 25 |id_#in~x|) .cse0 (<= |id_#t~ret0| 24)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= 12 |id_#t~ret0|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8)) (and (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret0| 19) .cse0 (<= |id_#in~x| 20) (<= 19 |id_#t~ret0|) (<= 20 |id_#in~x|)) (and (<= 13 |id_#t~ret0|) (<= 14 |id_#in~x|) .cse0 (<= |id_#t~ret0| 13) (<= |id_#in~x| 14)) (and (<= 17 |id_#t~ret0|) (<= 18 |id_#in~x|) .cse0 (<= |id_#in~x| 18) (<= |id_#t~ret0| 17)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) .cse0 (<= 20 |id_#t~ret0|) (<= |id_#t~ret0| 20)) (and .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret0|) (<= |id_#t~ret0| 15)) (and (<= 18 |id_#t~ret0|) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|) (<= |id_#t~ret0| 18)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7)) (and (<= |id_#t~ret0| 16) .cse0 (<= 16 |id_#t~ret0|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)))) [2020-09-04 21:56:42,299 INFO L264 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 13 |id_#t~ret0|) (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= |id_#t~ret0| 13) (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= |id_#res| 17) (<= |id_#t~ret0| 16) (<= 17 |id_#res|) .cse0 (<= 16 |id_#t~ret0|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse0 (<= 14 |id_#t~ret0|) (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 19 |id_#res|) (<= 18 |id_#t~ret0|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|) (<= |id_#t~ret0| 18)) (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#t~ret0| 22) (<= |id_#in~x| 23) (<= 22 |id_#t~ret0|) (<= 23 |id_#res|)) (and (<= |id_#t~ret0| 5) (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|) (<= 15 |id_#t~ret0|) (<= |id_#t~ret0| 15)) (and (<= |id_#t~ret0| 23) (<= 23 |id_#t~ret0|) .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|) (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|)) (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7)) (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret0| 11)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= |id_#res| 18) (<= 17 |id_#t~ret0|) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18) (<= |id_#t~ret0| 17)) (and .cse0 (<= 22 |id_#res|) (<= |id_#in~x| 22) (<= |id_#res| 22) (<= 22 |id_#in~x|) (<= |id_#t~ret0| 21) (<= 21 |id_#t~ret0|)) (and (<= 24 |id_#t~ret0|) (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= |id_#t~ret0| 24) (<= 25 |id_#res|)) (and (<= |id_#t~ret0| 19) .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 19 |id_#t~ret0|) (<= 20 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret0| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|) (<= 2 |id_#t~ret0|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret0|)) (and (<= 7 |id_#t~ret0|) (<= |id_#res| 8) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21) (<= 20 |id_#t~ret0|) (<= |id_#t~ret0| 20)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8)) (and (<= 2 |id_#res|) .cse0 (<= 1 |id_#t~ret0|) (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)))) [2020-09-04 21:56:42,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:56:42 BoogieIcfgContainer [2020-09-04 21:56:42,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:56:42,354 INFO L168 Benchmark]: Toolchain (without parser) took 49939.96 ms. Allocated memory was 145.2 MB in the beginning and 943.7 MB in the end (delta: 798.5 MB). Free memory was 102.3 MB in the beginning and 277.6 MB in the end (delta: -175.3 MB). Peak memory consumption was 783.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:42,354 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 21:56:42,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.44 ms. Allocated memory is still 145.2 MB. Free memory was 102.1 MB in the beginning and 92.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:42,355 INFO L168 Benchmark]: Boogie Preprocessor took 27.34 ms. Allocated memory is still 145.2 MB. Free memory was 92.8 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:42,356 INFO L168 Benchmark]: RCFGBuilder took 370.73 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 91.5 MB in the beginning and 169.0 MB in the end (delta: -77.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:42,357 INFO L168 Benchmark]: TraceAbstraction took 49253.72 ms. Allocated memory was 201.3 MB in the beginning and 943.7 MB in the end (delta: 742.4 MB). Free memory was 168.3 MB in the beginning and 277.6 MB in the end (delta: -109.3 MB). Peak memory consumption was 793.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:42,359 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 282.44 ms. Allocated memory is still 145.2 MB. Free memory was 102.1 MB in the beginning and 92.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.34 ms. Allocated memory is still 145.2 MB. Free memory was 92.8 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 370.73 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 91.5 MB in the beginning and 169.0 MB in the end (delta: -77.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49253.72 ms. Allocated memory was 201.3 MB in the beginning and 943.7 MB in the end (delta: 742.4 MB). Free memory was 168.3 MB in the beginning and 277.6 MB in the end (delta: -109.3 MB). Peak memory consumption was 793.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: 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: 9]: Procedure Contract for main Derived contract for procedure main: 25 <= input - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: ((((((((((((((((((((((((((((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((\result <= 16 && \old(x) == x) && 16 <= \old(x)) && \old(x) <= 16) && 16 <= \result)) || ((((\old(x) == x && \old(x) <= 10) && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((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))) || ((((\old(x) == x && 22 <= \result) && \old(x) <= 22) && \result <= 22) && 22 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((\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)) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((((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)) || (((11 <= \old(x) && \old(x) == x) && \result <= 11) && 11 <= \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)) && ((((((((((((((((\old(x) == x && 26 <= \old(x)) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((\result <= 16 && \old(x) == x) && 16 <= \old(x)) && \old(x) <= 16) && 16 <= \result)) || ((((\result <= 23 && \old(x) == x) && 23 <= \old(x)) && \old(x) <= 23) && 23 <= \result)) || !(12 <= \old(x))) || ((((\result <= 17 && 17 <= \result) && \old(x) == x) && \old(x) <= 17) && 17 <= \old(x))) || ((((\old(x) == x && 22 <= \result) && \old(x) <= 22) && \result <= 22) && 22 <= \old(x))) || (((25 <= \old(x) && \old(x) == x) && \result <= 25) && 25 <= \result)) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \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 && \old(x) <= 24) && \result <= 24) && 24 <= \old(x)) && 24 <= \result)) || ((((19 <= \result && \result <= 19) && \old(x) == x) && \old(x) <= 19) && 19 <= \old(x))) || ((((\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 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 37.2s, OverallIterations: 27, TraceHistogramMax: 27, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 659 SDtfs, 1773 SDslu, 6608 SDs, 0 SdLazy, 7212 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1673 GetRequests, 838 SyntacticMatches, 0 SemanticMatches, 835 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5600 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred 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.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 259 PreInvPairs, 2518 NumberOfFragments, 2730 HoareAnnotationTreeSize, 259 FomulaSimplifications, 1786 FormulaSimplificationTreeSizeReduction, 4.9s HoareSimplificationTime, 25 FomulaSimplificationsInter, 30158 FormulaSimplificationTreeSizeReductionInter, 6.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 3240 NumberOfCodeBlocks, 3240 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3213 ConstructedInterpolants, 0 QuantifiedInterpolants, 1376573 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...