/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_i20_o20-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:55:43,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:55:43,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:55:43,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:55:43,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:55:43,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:55:43,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:55:43,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:55:43,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:55:43,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:55:43,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:55:43,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:55:43,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:55:43,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:55:43,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:55:43,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:55:43,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:55:43,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:55:43,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:55:43,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:55:43,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:55:43,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:55:43,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:55:43,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:55:43,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:55:43,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:55:43,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:55:43,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:55:43,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:55:43,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:55:43,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:55:43,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:55:43,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:55:43,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:55:43,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:55:43,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:55:43,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:55:43,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:55:43,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:55:43,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:55:43,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:55:43,696 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:43,712 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:55:43,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:55:43,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:55:43,715 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:55:43,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:55:43,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:55:43,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:55:43,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:55:43,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:55:43,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:55:43,717 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:55:43,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:55:43,718 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:55:43,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:55:43,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:55:43,719 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:55:43,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:55:43,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:55:43,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:55:43,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:55:43,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:55:43,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:55:43,721 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:44,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:55:44,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:55:44,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:55:44,343 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:55:44,344 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:55:44,345 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2020-09-04 21:55:44,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9faa36965/eda7d0ec9a3746f4a9039e9f5e6cbf73/FLAGaa6ebeb62 [2020-09-04 21:55:45,198 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:55:45,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2020-09-04 21:55:45,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9faa36965/eda7d0ec9a3746f4a9039e9f5e6cbf73/FLAGaa6ebeb62 [2020-09-04 21:55:45,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9faa36965/eda7d0ec9a3746f4a9039e9f5e6cbf73 [2020-09-04 21:55:45,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:55:45,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:55:45,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:45,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:55:45,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:55:45,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:45" (1/1) ... [2020-09-04 21:55:45,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb2e3cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:45, skipping insertion in model container [2020-09-04 21:55:45,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:45" (1/1) ... [2020-09-04 21:55:45,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:55:45,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:55:45,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:45,933 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:55:45,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:45,979 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:55:45,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:45 WrapperNode [2020-09-04 21:55:45,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:45,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:55:45,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:55:45,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:55:46,007 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:45" (1/1) ... [2020-09-04 21:55:46,007 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:45" (1/1) ... [2020-09-04 21:55:46,015 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:45" (1/1) ... [2020-09-04 21:55:46,016 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:45" (1/1) ... [2020-09-04 21:55:46,022 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:45" (1/1) ... [2020-09-04 21:55:46,025 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:45" (1/1) ... [2020-09-04 21:55:46,027 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:45" (1/1) ... [2020-09-04 21:55:46,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:55:46,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:55:46,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:55:46,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:55:46,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:45" (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:46,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:55:46,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:55:46,262 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 21:55:46,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:55:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:55:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:55:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 21:55:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:55:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:55:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:55:46,498 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:55:46,499 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:55:46,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:46 BoogieIcfgContainer [2020-09-04 21:55:46,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:55:46,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:55:46,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:55:46,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:55:46,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:55:45" (1/3) ... [2020-09-04 21:55:46,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0c117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:46, skipping insertion in model container [2020-09-04 21:55:46,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:45" (2/3) ... [2020-09-04 21:55:46,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0c117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:46, skipping insertion in model container [2020-09-04 21:55:46,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:46" (3/3) ... [2020-09-04 21:55:46,515 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i20_o20-1.c [2020-09-04 21:55:46,528 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:55:46,539 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:55:46,563 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:55:46,596 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:55:46,596 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:55:46,596 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:55:46,597 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:55:46,597 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:55:46,597 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:55:46,597 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:55:46,597 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:55:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 21:55:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:55:46,633 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:46,635 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:46,636 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:46,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 21:55:46,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:46,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [106306284] [2020-09-04 21:55:46,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:46,967 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:46,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [106306284] [2020-09-04 21:55:46,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:46,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:46,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441490180] [2020-09-04 21:55:46,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:46,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:47,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:47,024 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 21:55:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:47,136 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 21:55:47,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:55:47,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:55:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:47,154 INFO L225 Difference]: With dead ends: 37 [2020-09-04 21:55:47,154 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 21:55:47,159 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 21:55:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 21:55:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 21:55:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 21:55:47,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 21:55:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:47,218 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 21:55:47,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 21:55:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 21:55:47,221 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:47,221 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:47,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:55:47,222 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:47,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 21:55:47,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:47,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [923143970] [2020-09-04 21:55:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,376 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:47,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [923143970] [2020-09-04 21:55:47,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:47,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:55:47,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075835844] [2020-09-04 21:55:47,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:55:47,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:47,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:55:47,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:47,382 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 21:55:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:47,457 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 21:55:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:55:47,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 21:55:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:47,460 INFO L225 Difference]: With dead ends: 34 [2020-09-04 21:55:47,460 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 21:55:47,462 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:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 21:55:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 21:55:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:55:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 21:55:47,474 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 21:55:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:47,475 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 21:55:47,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:55:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 21:55:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 21:55:47,477 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:47,477 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:47,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:55:47,478 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:47,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 21:55:47,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:47,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [225977636] [2020-09-04 21:55:47,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,675 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:47,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [225977636] [2020-09-04 21:55:47,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:47,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:55:47,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911898921] [2020-09-04 21:55:47,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:55:47,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:47,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:55:47,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:55:47,679 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 21:55:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:47,787 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 21:55:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:55:47,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 21:55:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:47,790 INFO L225 Difference]: With dead ends: 39 [2020-09-04 21:55:47,790 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 21:55:47,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:55:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 21:55:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 21:55:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 21:55:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 21:55:47,802 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 21:55:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:47,803 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 21:55:47,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:55:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 21:55:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 21:55:47,805 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:47,805 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:47,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:55:47,806 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 21:55:47,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:47,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275228993] [2020-09-04 21:55:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:47,987 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:47,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275228993] [2020-09-04 21:55:47,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:47,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:55:47,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18348809] [2020-09-04 21:55:47,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:55:47,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:47,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:55:47,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:55:47,991 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 21:55:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:48,092 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 21:55:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:55:48,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 21:55:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:48,094 INFO L225 Difference]: With dead ends: 44 [2020-09-04 21:55:48,094 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 21:55:48,095 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:55:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 21:55:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 21:55:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 21:55:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 21:55:48,107 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 21:55:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:48,107 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 21:55:48,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:55:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 21:55:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 21:55:48,109 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:48,109 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:48,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:55:48,110 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:48,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:48,110 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 21:55:48,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:48,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [767344907] [2020-09-04 21:55:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,326 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:48,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [767344907] [2020-09-04 21:55:48,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:48,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:55:48,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216335279] [2020-09-04 21:55:48,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:55:48,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:48,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:55:48,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:55:48,329 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 21:55:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:48,418 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 21:55:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:55:48,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 21:55:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:48,420 INFO L225 Difference]: With dead ends: 49 [2020-09-04 21:55:48,420 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 21:55:48,421 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:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 21:55:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 21:55:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 21:55:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 21:55:48,433 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 21:55:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:48,433 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 21:55:48,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:55:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 21:55:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 21:55:48,437 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:48,437 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:48,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:55:48,438 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:48,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:48,438 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 21:55:48,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:48,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [563513747] [2020-09-04 21:55:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,686 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:48,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [563513747] [2020-09-04 21:55:48,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:48,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:55:48,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525224979] [2020-09-04 21:55:48,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:55:48,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:48,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:55:48,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:55:48,689 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 21:55:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:48,794 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 21:55:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:55:48,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 21:55:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:48,796 INFO L225 Difference]: With dead ends: 54 [2020-09-04 21:55:48,796 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 21:55:48,797 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:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 21:55:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 21:55:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 21:55:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 21:55:48,808 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 21:55:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:48,808 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 21:55:48,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:55:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 21:55:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 21:55:48,811 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:48,811 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:48,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:55:48,812 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 21:55:48,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:48,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512768966] [2020-09-04 21:55:48,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:48,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,085 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:49,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [512768966] [2020-09-04 21:55:49,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:49,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:55:49,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606090002] [2020-09-04 21:55:49,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:55:49,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:49,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:55:49,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:55:49,088 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 21:55:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:49,235 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 21:55:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:55:49,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 21:55:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:49,238 INFO L225 Difference]: With dead ends: 59 [2020-09-04 21:55:49,238 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 21:55:49,239 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:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 21:55:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 21:55:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 21:55:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 21:55:49,250 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 21:55:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:49,251 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 21:55:49,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:55:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 21:55:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:55:49,253 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:49,253 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:49,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:55:49,254 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 21:55:49,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:49,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1723440674] [2020-09-04 21:55:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,532 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:49,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1723440674] [2020-09-04 21:55:49,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:49,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:55:49,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631958045] [2020-09-04 21:55:49,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:55:49,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:55:49,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:55:49,535 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 21:55:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:49,673 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 21:55:49,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:55:49,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 21:55:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:49,675 INFO L225 Difference]: With dead ends: 64 [2020-09-04 21:55:49,676 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 21:55:49,677 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:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 21:55:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 21:55:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 21:55:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 21:55:49,687 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 21:55:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:49,687 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 21:55:49,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:55:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 21:55:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 21:55:49,690 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:49,690 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:49,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:55:49,690 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 21:55:49,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:49,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [462831202] [2020-09-04 21:55:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:49,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,056 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:50,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [462831202] [2020-09-04 21:55:50,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:50,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:55:50,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138036903] [2020-09-04 21:55:50,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:55:50,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:50,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:55:50,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:55:50,059 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 21:55:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:50,200 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 21:55:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:55:50,200 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 21:55:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:50,202 INFO L225 Difference]: With dead ends: 69 [2020-09-04 21:55:50,202 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 21:55:50,203 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:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 21:55:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 21:55:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 21:55:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 21:55:50,213 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 21:55:50,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:50,214 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 21:55:50,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:55:50,214 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 21:55:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 21:55:50,216 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:50,216 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:50,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:55:50,216 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 21:55:50,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:50,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384229231] [2020-09-04 21:55:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,586 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:50,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1384229231] [2020-09-04 21:55:50,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:50,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:55:50,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601014329] [2020-09-04 21:55:50,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:55:50,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:50,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:55:50,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:55:50,589 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 21:55:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:50,739 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 21:55:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:55:50,740 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 21:55:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:50,741 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:55:50,742 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:55:50,743 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:55:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:55:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 21:55:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 21:55:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 21:55:50,752 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 21:55:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:50,752 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 21:55:50,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:55:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 21:55:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 21:55:50,756 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:50,756 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:50,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:55:50,756 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 21:55:50,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:50,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [449222866] [2020-09-04 21:55:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:50,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,184 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:51,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [449222866] [2020-09-04 21:55:51,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:51,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:55:51,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335910668] [2020-09-04 21:55:51,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:55:51,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:55:51,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:55:51,187 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2020-09-04 21:55:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:51,361 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 21:55:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:55:51,362 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2020-09-04 21:55:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:51,363 INFO L225 Difference]: With dead ends: 79 [2020-09-04 21:55:51,363 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 21:55:51,364 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:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 21:55:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-09-04 21:55:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 21:55:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-09-04 21:55:51,376 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-09-04 21:55:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:51,376 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-09-04 21:55:51,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:55:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-09-04 21:55:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 21:55:51,378 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:51,378 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:51,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:55:51,379 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-09-04 21:55:51,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:51,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249559248] [2020-09-04 21:55:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:51,895 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:51,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1249559248] [2020-09-04 21:55:51,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:51,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:55:51,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954960864] [2020-09-04 21:55:51,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:55:51,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:51,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:55:51,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:55:51,898 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-09-04 21:55:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:52,079 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-09-04 21:55:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:55:52,080 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 21:55:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:52,081 INFO L225 Difference]: With dead ends: 84 [2020-09-04 21:55:52,081 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:55:52,082 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:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:55:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 21:55:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 21:55:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 21:55:52,092 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 104 [2020-09-04 21:55:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:52,092 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 21:55:52,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:55:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 21:55:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 21:55:52,094 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:52,094 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:52,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:55:52,094 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1287598415, now seen corresponding path program 12 times [2020-09-04 21:55:52,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:52,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [243433564] [2020-09-04 21:55:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,677 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:52,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [243433564] [2020-09-04 21:55:52,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:52,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:55:52,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702045514] [2020-09-04 21:55:52,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:55:52,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:55:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:55:52,681 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 17 states. [2020-09-04 21:55:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:52,876 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-09-04 21:55:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:55:52,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2020-09-04 21:55:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:52,878 INFO L225 Difference]: With dead ends: 89 [2020-09-04 21:55:52,878 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 21:55:52,879 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:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 21:55:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-09-04 21:55:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 21:55:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2020-09-04 21:55:52,889 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 112 [2020-09-04 21:55:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:52,890 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2020-09-04 21:55:52,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:55:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2020-09-04 21:55:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 21:55:52,891 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:52,891 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:52,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:55:52,892 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:52,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1612559463, now seen corresponding path program 13 times [2020-09-04 21:55:52,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:52,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545266588] [2020-09-04 21:55:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:52,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,551 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:55:53,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545266588] [2020-09-04 21:55:53,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:53,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 21:55:53,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330331669] [2020-09-04 21:55:53,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 21:55:53,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 21:55:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:55:53,554 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 18 states. [2020-09-04 21:55:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:53,779 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-09-04 21:55:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:55:53,780 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2020-09-04 21:55:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:53,781 INFO L225 Difference]: With dead ends: 94 [2020-09-04 21:55:53,781 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 21:55:53,783 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:55:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 21:55:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-09-04 21:55:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 21:55:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2020-09-04 21:55:53,792 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 120 [2020-09-04 21:55:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:53,792 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2020-09-04 21:55:53,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 21:55:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2020-09-04 21:55:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 21:55:53,794 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:53,795 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:55:53,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:55:53,795 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:53,796 INFO L82 PathProgramCache]: Analyzing trace with hash 996432753, now seen corresponding path program 14 times [2020-09-04 21:55:53,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:53,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [960262521] [2020-09-04 21:55:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:53,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,096 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,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,357 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,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,539 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:55:54,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [960262521] [2020-09-04 21:55:54,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:54,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:55:54,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550900291] [2020-09-04 21:55:54,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:55:54,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:54,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:55:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:55:54,542 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 19 states. [2020-09-04 21:55:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:54,805 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 21:55:54,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:55:54,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2020-09-04 21:55:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:54,807 INFO L225 Difference]: With dead ends: 99 [2020-09-04 21:55:54,807 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 21:55:54,811 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:55:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 21:55:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-09-04 21:55:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 21:55:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2020-09-04 21:55:54,826 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 128 [2020-09-04 21:55:54,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:54,827 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2020-09-04 21:55:54,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:55:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2020-09-04 21:55:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 21:55:54,830 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:54,830 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:55:54,831 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:55:54,831 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:54,831 INFO L82 PathProgramCache]: Analyzing trace with hash 418248103, now seen corresponding path program 15 times [2020-09-04 21:55:54,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:54,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776444120] [2020-09-04 21:55:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:54,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:55,733 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:55:55,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776444120] [2020-09-04 21:55:55,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:55,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:55:55,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130255417] [2020-09-04 21:55:55,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:55:55,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:55,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:55:55,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:55:55,739 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 20 states. [2020-09-04 21:55:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:56,018 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-09-04 21:55:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:55:56,019 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2020-09-04 21:55:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:56,020 INFO L225 Difference]: With dead ends: 104 [2020-09-04 21:55:56,020 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 21:55:56,022 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:55:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 21:55:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 21:55:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 21:55:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2020-09-04 21:55:56,041 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 136 [2020-09-04 21:55:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:56,041 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2020-09-04 21:55:56,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:55:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2020-09-04 21:55:56,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 21:55:56,043 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:56,043 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:55:56,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:55:56,043 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2106505265, now seen corresponding path program 16 times [2020-09-04 21:55:56,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:56,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [359909116] [2020-09-04 21:55:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,301 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,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:56,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,109 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:55:57,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [359909116] [2020-09-04 21:55:57,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:57,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 21:55:57,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368374411] [2020-09-04 21:55:57,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 21:55:57,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 21:55:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:55:57,114 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 21 states. [2020-09-04 21:55:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:57,457 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-09-04 21:55:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:55:57,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 144 [2020-09-04 21:55:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:57,461 INFO L225 Difference]: With dead ends: 109 [2020-09-04 21:55:57,462 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 21:55:57,463 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:55:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 21:55:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-09-04 21:55:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-04 21:55:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2020-09-04 21:55:57,474 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 144 [2020-09-04 21:55:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:57,476 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2020-09-04 21:55:57,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 21:55:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2020-09-04 21:55:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-09-04 21:55:57,479 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:57,479 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:55:57,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 21:55:57,479 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:57,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:57,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1225615079, now seen corresponding path program 17 times [2020-09-04 21:55:57,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:57,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [633545897] [2020-09-04 21:55:57,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:57,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:58,638 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:55:58,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [633545897] [2020-09-04 21:55:58,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:58,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 21:55:58,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032601622] [2020-09-04 21:55:58,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 21:55:58,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:58,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 21:55:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:55:58,647 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 22 states. [2020-09-04 21:55:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:58,979 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-09-04 21:55:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:55:58,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 152 [2020-09-04 21:55:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:58,982 INFO L225 Difference]: With dead ends: 114 [2020-09-04 21:55:58,982 INFO L226 Difference]: Without dead ends: 108 [2020-09-04 21:55:58,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 21:55:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-09-04 21:55:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-09-04 21:55:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-09-04 21:55:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2020-09-04 21:55:58,998 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 152 [2020-09-04 21:55:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:58,998 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2020-09-04 21:55:58,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 21:55:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2020-09-04 21:55:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-09-04 21:55:59,001 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:59,001 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:55:59,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 21:55:59,002 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2080643855, now seen corresponding path program 18 times [2020-09-04 21:55:59,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:59,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228439352] [2020-09-04 21:55:59,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,487 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 2 [2020-09-04 21:55:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,574 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,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:59,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,447 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:00,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228439352] [2020-09-04 21:56:00,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:00,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:56:00,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103948212] [2020-09-04 21:56:00,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:56:00,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:56:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:56:00,450 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 23 states. [2020-09-04 21:56:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:00,777 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-09-04 21:56:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 21:56:00,778 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 160 [2020-09-04 21:56:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:00,780 INFO L225 Difference]: With dead ends: 119 [2020-09-04 21:56:00,780 INFO L226 Difference]: Without dead ends: 113 [2020-09-04 21:56:00,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 21:56:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-04 21:56:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-09-04 21:56:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-09-04 21:56:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2020-09-04 21:56:00,796 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 160 [2020-09-04 21:56:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:00,796 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2020-09-04 21:56:00,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:56:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2020-09-04 21:56:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 21:56:00,799 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:00,799 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:00,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 21:56:00,799 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1136658471, now seen corresponding path program 19 times [2020-09-04 21:56:00,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:00,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [822508395] [2020-09-04 21:56:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:00,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,538 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,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:01,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,093 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:02,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [822508395] [2020-09-04 21:56:02,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:02,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-04 21:56:02,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118344993] [2020-09-04 21:56:02,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 21:56:02,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 21:56:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:56:02,097 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 24 states. [2020-09-04 21:56:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:02,486 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-09-04 21:56:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:56:02,487 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 168 [2020-09-04 21:56:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:02,490 INFO L225 Difference]: With dead ends: 124 [2020-09-04 21:56:02,490 INFO L226 Difference]: Without dead ends: 118 [2020-09-04 21:56:02,492 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:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-09-04 21:56:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-09-04 21:56:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-09-04 21:56:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2020-09-04 21:56:02,511 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 168 [2020-09-04 21:56:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:02,513 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2020-09-04 21:56:02,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 21:56:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2020-09-04 21:56:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-09-04 21:56:02,517 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:02,517 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:02,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 21:56:02,518 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1108876879, now seen corresponding path program 20 times [2020-09-04 21:56:02,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:02,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [960062008] [2020-09-04 21:56:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:02,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:03,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:04,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:05,449 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:05,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [960062008] [2020-09-04 21:56:05,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:05,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2020-09-04 21:56:05,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58077424] [2020-09-04 21:56:05,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-09-04 21:56:05,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-09-04 21:56:05,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 21:56:05,452 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 45 states. [2020-09-04 21:56:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:08,321 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-09-04 21:56:08,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2020-09-04 21:56:08,322 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 176 [2020-09-04 21:56:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:08,324 INFO L225 Difference]: With dead ends: 129 [2020-09-04 21:56:08,324 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 21:56:08,326 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=171, Invalid=4119, Unknown=0, NotChecked=0, Total=4290 [2020-09-04 21:56:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 21:56:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-09-04 21:56:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 21:56:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2020-09-04 21:56:08,339 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 176 [2020-09-04 21:56:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:08,340 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2020-09-04 21:56:08,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-09-04 21:56:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2020-09-04 21:56:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-09-04 21:56:08,343 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:08,343 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:08,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 21:56:08,344 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash 390715751, now seen corresponding path program 21 times [2020-09-04 21:56:08,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:08,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1576887080] [2020-09-04 21:56:08,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:56:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,638 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,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:08,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:09,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 1050 proven. 42 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-09-04 21:56:10,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1576887080] [2020-09-04 21:56:10,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:10,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-04 21:56:10,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105839476] [2020-09-04 21:56:10,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 21:56:10,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 21:56:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:56:10,137 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 26 states. [2020-09-04 21:56:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:12,290 INFO L93 Difference]: Finished difference Result 281 states and 722 transitions. [2020-09-04 21:56:12,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-09-04 21:56:12,294 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2020-09-04 21:56:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:12,295 INFO L225 Difference]: With dead ends: 281 [2020-09-04 21:56:12,296 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:56:12,305 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=767, Invalid=1489, Unknown=0, NotChecked=0, Total=2256 [2020-09-04 21:56:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:56:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:56:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:56:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:56:12,308 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2020-09-04 21:56:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:12,308 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:56:12,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 21:56:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:56:12,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:56:12,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 21:56:12,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:56:17,351 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 229 DAG size of output: 171 [2020-09-04 21:56:18,180 WARN L193 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 131 [2020-09-04 21:56:19,192 WARN L193 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 131 [2020-09-04 21:56:20,095 WARN L193 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 127 [2020-09-04 21:56:20,885 WARN L193 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 127 [2020-09-04 21:56:20,891 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:56:20,892 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:56:20,892 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:56:20,892 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:56:20,892 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:56:20,892 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:56:20,892 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: false [2020-09-04 21:56:20,892 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-09-04 21:56:20,893 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 9 15) the Hoare annotation is: (<= 20 main_~input~0) [2020-09-04 21:56:20,893 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: false [2020-09-04 21:56:20,893 INFO L264 CegarLoopResult]: At program point L12(lines 12 14) the Hoare annotation is: (and (<= 20 main_~input~0) (<= main_~result~0 20) (<= 20 main_~result~0)) [2020-09-04 21:56:20,893 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 20) (<= 20 main_~input~0)) [2020-09-04 21:56:20,893 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (<= 20 |main_#t~ret1|) (<= 20 main_~input~0) (<= |main_#t~ret1| 20)) [2020-09-04 21:56:20,893 INFO L264 CegarLoopResult]: At program point L12-2(lines 9 15) the Hoare annotation is: (<= 20 main_~input~0) [2020-09-04 21:56:20,894 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (and (<= 20 |main_#t~ret1|) (<= 20 main_~input~0) (<= |main_#t~ret1| 20)) [2020-09-04 21:56:20,894 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (<= 20 |main_#t~ret1|) (<= 20 main_~input~0) (<= main_~result~0 20) (<= |main_#t~ret1| 20) (<= 20 main_~result~0)) [2020-09-04 21:56:20,895 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 7) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (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 (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and .cse0 (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)))) [2020-09-04 21:56:20,895 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 7) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (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 (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and .cse0 (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)))) [2020-09-04 21:56:20,895 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-09-04 21:56:20,895 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 21:56:20,895 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 21:56:20,896 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|)) (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret0| 11)) (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 (<= 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 .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 .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret0|) (<= |id_#t~ret0| 15)) (and (<= |id_#t~ret0| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|)) (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 (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|)) (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= |id_#t~ret0| 16) .cse0 (<= 16 |id_#t~ret0|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= 12 |id_#t~ret0|)) (and (<= |id_#t~ret0| 19) .cse0 (<= 19 |id_#t~ret0|) (<= 20 |id_#in~x|)))) [2020-09-04 21:56:20,896 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:20,896 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|)) (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret0| 11)) (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 (<= 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 .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 .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret0|) (<= |id_#t~ret0| 15)) (and (<= |id_#t~ret0| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|)) (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 (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|)) (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= |id_#t~ret0| 16) .cse0 (<= 16 |id_#t~ret0|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= 12 |id_#t~ret0|)) (and (<= |id_#t~ret0| 19) .cse0 (<= 19 |id_#t~ret0|) (<= 20 |id_#in~x|)))) [2020-09-04 21:56:20,897 INFO L264 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: (let ((.cse20 (<= 18 |id_#in~x|)) (.cse19 (<= 4 |id_#in~x|)) (.cse5 (= |id_#in~x| id_~x))) (let ((.cse0 (and (<= |id_#res| 17) (<= |id_#t~ret0| 16) (<= 17 |id_#res|) .cse5 (<= 16 |id_#t~ret0|) (<= 17 |id_#in~x|))) (.cse1 (and (<= 13 |id_#t~ret0|) (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse5 (<= |id_#t~ret0| 13) (<= 14 |id_#res|) (<= |id_#in~x| 14))) (.cse2 (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse5 (<= |id_#res| 5) (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))) (.cse4 (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse5 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10))) (.cse7 (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse5 (<= 14 |id_#t~ret0|) (<= |id_#in~x| 15) (<= |id_#res| 15))) (.cse8 (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse5 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) .cse19)) (.cse10 (and (<= |id_#t~ret0| 5) (<= |id_#res| 6) .cse5 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|))) (.cse11 (and (<= |id_#res| 16) .cse5 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|) (<= 15 |id_#t~ret0|) (<= |id_#t~ret0| 15))) (.cse12 (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse5 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret0|))) (.cse13 (and (<= 7 |id_#res|) .cse5 (<= |id_#res| 7) (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7))) (.cse14 (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse5 (<= |id_#res| 11) (<= 11 |id_#res|) (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|))) (.cse16 (and (<= 7 |id_#t~ret0|) (<= |id_#res| 8) (<= |id_#t~ret0| 7) .cse5 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8))) (.cse17 (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse5 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret0| 11))) (.cse18 (and (<= 9 |id_#res|) .cse5 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8))) (.cse3 (and (<= |id_#res| 18) (<= 17 |id_#t~ret0|) .cse20 .cse5 (<= 18 |id_#res|) (<= |id_#in~x| 18) (<= |id_#t~ret0| 17))) (.cse15 (and (<= 21 |id_#in~x|) .cse5)) (.cse6 (and (<= |id_#t~ret0| 19) .cse5 (<= 20 |id_#res|) (<= |id_#res| 20) (<= 19 |id_#t~ret0|) (<= 20 |id_#in~x|))) (.cse9 (and (<= 19 |id_#res|) (<= 18 |id_#t~ret0|) (<= |id_#res| 19) .cse5 (<= |id_#in~x| 19) (<= 19 |id_#in~x|) (<= |id_#t~ret0| 18)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (<= 1 |id_#in~x|) .cse5 (<= |id_#res| 1) (= |id_#t~ret0| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) .cse6 .cse7 (and (<= |id_#res| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse5 (<= 3 |id_#res|) (<= 2 |id_#t~ret0|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and (<= 2 |id_#res|) .cse5 (<= 1 |id_#t~ret0|) (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not .cse19) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse3 (not .cse20) .cse15 .cse6 .cse9)))) [2020-09-04 21:56:20,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:56:20 BoogieIcfgContainer [2020-09-04 21:56:20,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:56:20,935 INFO L168 Benchmark]: Toolchain (without parser) took 35372.51 ms. Allocated memory was 135.3 MB in the beginning and 714.1 MB in the end (delta: 578.8 MB). Free memory was 100.0 MB in the beginning and 403.0 MB in the end (delta: -303.0 MB). Peak memory consumption was 562.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:20,935 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 135.3 MB. Free memory was 117.8 MB in the beginning and 117.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:20,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.12 ms. Allocated memory is still 135.3 MB. Free memory was 99.5 MB in the beginning and 90.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:20,936 INFO L168 Benchmark]: Boogie Preprocessor took 45.19 ms. Allocated memory is still 135.3 MB. Free memory was 90.5 MB in the beginning and 89.1 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:20,937 INFO L168 Benchmark]: RCFGBuilder took 475.04 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 89.1 MB in the beginning and 167.4 MB in the end (delta: -78.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:20,938 INFO L168 Benchmark]: TraceAbstraction took 34427.41 ms. Allocated memory was 199.2 MB in the beginning and 714.1 MB in the end (delta: 514.9 MB). Free memory was 166.7 MB in the beginning and 403.0 MB in the end (delta: -236.3 MB). Peak memory consumption was 564.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:20,942 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 135.3 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 410.12 ms. Allocated memory is still 135.3 MB. Free memory was 99.5 MB in the beginning and 90.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.19 ms. Allocated memory is still 135.3 MB. Free memory was 90.5 MB in the beginning and 89.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 475.04 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 89.1 MB in the beginning and 167.4 MB in the end (delta: -78.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34427.41 ms. Allocated memory was 199.2 MB in the beginning and 714.1 MB in the end (delta: 514.9 MB). Free memory was 166.7 MB in the beginning and 403.0 MB in the end (delta: -236.3 MB). Peak memory consumption was 564.9 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: 20 <= 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) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1)) || ((((\old(x) <= 11 && 11 <= \old(x)) && \old(x) == x) && \result <= 11) && 11 <= \result)) || ((((\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)) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || ((((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)) || ((((\result <= 17 && 17 <= \result) && \old(x) == x) && \old(x) <= 17) && 17 <= \old(x))) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || (((\old(x) == x && 20 <= \result) && \result <= 20) && 20 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\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)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((19 <= \result && \result <= 19) && \old(x) == x) && \old(x) <= 19) && 19 <= \old(x))) || (21 <= \old(x) && \old(x) == x)) || ((((\result <= 18 && 18 <= \old(x)) && \old(x) == x) && 18 <= \result) && \old(x) <= 18) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.7s, OverallIterations: 22, TraceHistogramMax: 22, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 534 SDtfs, 1202 SDslu, 4654 SDs, 0 SdLazy, 4754 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1143 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 570 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2930 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=21, 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, 22 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 214 PreInvPairs, 1773 NumberOfFragments, 2288 HoareAnnotationTreeSize, 214 FomulaSimplifications, 1431 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 25 FomulaSimplificationsInter, 19740 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 2200 NumberOfCodeBlocks, 2200 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2178 ConstructedInterpolants, 0 QuantifiedInterpolants, 771898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 6132/13244 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...